我有一个名为Movie的类，其中有一个静态数组Movie[] movies。我实现了Comparable接口并重载了compareTo方法。如果一部电影的“喜欢度”与另一部电影的相同，则按字母顺序进行比较。我必须创建一个快速排序的实现来对电影数组进行排序。但是在return this.compareTo(m);这一行中，我遇到了堆栈溢出错误。我该如何解决？
public int compareTo(Movie m) {
if (this.likes == m.likes) {
//DefaultComparator cmp = new DefaultComparator();
return this.compareTo(m);
} else if (this.likes > m.likes) {
return 1;
} else {
return -1;
}
}
public static Movie[] sort(Movie[] m) {
if (m == null || m.length == 0) {
return null;
} else {
movies = m;
quicksort(0, movies.length - 1); // sort the entire array
return movies;
}
}
public static void quicksort(int left, int right) {
int i = left;
int j = right;
Movie pivot = movies[left + (right - left) / 2];
while (i <= j) {
while (movies[i].compareTo(pivot) == -1) {
i++;
}
while (movies[j].compareTo(pivot) == 1) {
j--;
}
if (i <= j) {
exch(i, j);
i++;
j--;
}
}
if (left < j) {
quicksort(left, j);
}
if (i < right) {
quicksort(i, right);
}
}
public static void exch(int i, int j) {
Movie temp = movies[i];
movies[i] = movies[j];
movies[j] = temp;
}