[英]Java Top-Down Merge Sort - Stackoverflow Error
I am trying to implement the top-down merge sort algorithm in Java, using the pseudocode from Wikipedia .我正在尝试使用Wikipedia 中的伪代码在 Java 中实现自上而下的合并排序算法。
My problem is that my code sometimes throws a StackOverflowError, but not always.我的问题是我的代码有时会抛出 StackOverflowError,但并非总是如此。 I have checked that my code matches the pseudocode several times and cannot find what is wrong with it.我已经多次检查我的代码是否与伪代码匹配,但找不到它有什么问题。
Here is my Java code:这是我的 Java 代码:
import java.util.ArrayList;
import java.util.Random;
public class Main {
public static void main(String[] args) {
Random r = new Random();
ArrayList<Integer> numbers = new ArrayList<Integer>();
for (int i = 1; i <= 15; i++) {
numbers.add(r.nextInt(100));
}
numbers = mergeSort(numbers);
System.out.println(numbers);
}
public static ArrayList<Integer> mergeSort(ArrayList<Integer> m) {
if (m.size() <= 1) {
return m;
}
ArrayList<Integer> left = new ArrayList<Integer>();
ArrayList<Integer> right = new ArrayList<Integer>();
for (Integer x : m) {
if (m.indexOf(x) < (m.size()) / 2)
left.add(x);
else {
right.add(x);
}
}
left = mergeSort(left);
right = mergeSort(right);
return merge(left, right);
}
private static ArrayList<Integer> merge(ArrayList<Integer> l, ArrayList<Integer> r) {
ArrayList<Integer> result = new ArrayList<Integer>();
while (l.size() > 0 && r.size() > 0) {
if (l.get(0) <= r.get(0)) {
result.add(l.get(0));
l.remove(0);
}
else {
result.add(r.get(0));
r.remove(0);
}
}
while (l.size() > 0) {
result.add(l.get(0));
l.remove(0);
}
while (r.size() > 0) {
result.add(r.get(0));
r.remove(0);
}
return result;
}
}
Your algorithm encounters issues when there are duplicate elements, as indexOf
will only return the index of the first one.当存在重复元素时,您的算法会遇到问题,因为indexOf
只会返回第一个元素的索引。 Use a index-based for
loop instead.请改用基于索引的for
循环。 Demo演示
for (int i = 0; i < m.size(); i++) {
if (i < (m.size()) / 2)
left.add(m.get(i));
else {
right.add(m.get(i));
}
}
In the mergeSort method need to change the for loop little bit and try again.在mergeSort 方法中需要稍微改变一下for 循环,然后再试一次。
for (int i=0;i< m.size()/2;i++)
left.add(m.get(i));
for (int i=m.size()/2;i< m.size();i++)
right.add(m.get(i));
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.