[英]How to sort an array of objects using MergeSort in java without comparator
I need to sort a huge array of objects.我需要对大量对象进行排序。 Each object contains a number.
每个 object 都包含一个数字。 I need to sort it by that number, but I can't use a comparator.
我需要按该数字对其进行排序,但我不能使用比较器。 Is it possible to do it using a
mergesort
algorithm?是否可以使用
mergesort
排序算法来做到这一点?
As long as each object has a way to be compared (typically done in a 'compareTo(T other)' function), mergesort is a viable solution.只要每个 object 都有一种比较方法(通常在 'compareTo(T other)' 函数中完成),归并排序是一个可行的解决方案。
EDIT: More thoroughly, it would look something like this:编辑:更彻底,它看起来像这样:
public int compareTo(T other){
if this.getNumber() == other.getNumber(){
return 0;
}
else if this.getNumber() > other.getNumber(){
return 1;
}
else{
return -1;
}
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.