java arrays.sort排序_【转】Java中Collections.sort()和Arrays.sort()所采用的排序算法

最新推荐文章于 2024-08-28 15:15:00 发布

52赫兹的咸鱼

最新推荐文章于 2024-08-28 15:15:00 发布

阅读量177

点赞数

文章标签： java arrays.sort排序

本文链接：https://blog.csdn.net/weixin_32153867/article/details/114182766

版权

Java中如果需要对一个collections排序，需要继承于Comparable或者comparator接口，那么使用的排序算法是什么呢，一般情况下，排序算法包括：插入排序、快速排序、合并排序、冒泡排序等，java的Collections.sort算法调用的是合并排序，它是稳定排序，当数据接近有序的时候，效率更高，collections中的数据在排序前需要输入到array中，接着调用Arrays.sort函数来完成对象排序，最近通过迭代器将数组中排好序的对象些人到collection中，这也要求collection必须为mutable类型的。合并排序的大致过程为：void mergerSort(int[] a){int len =a.lenght()int mid = len>>2

if(len>1){int[] pre=a[0:mid);int[] after=a[mid:len);

mergerSort(pre);

mergerSort(after);

merge(a,pre,after)

}

}1.collections转化为array，并借助于arrays的sort功能完成排序，并回写到collectionpublic static void sort(List list, Comparator super T>c) {

Object[] a=list.toArray();

Arrays.sort(a, (Comparator)c);

ListIterator i=list.listIterator();for (int j=0; j

i.next();

i.set(a[j]);

}

}2. Arrays合并排序的实现：public static void sort(T[] a, Comparator super T>c) {if(LegacyMergeSort.userRequested)

legacyMergeSort(a, c);elseTimSort.sort(a, c);

}/**To be removed in a future release.*/

private static void legacyMergeSort(T[] a, Comparator super T>c) {

T[] aux=a.clone();if (c==null)

mergeSort(aux, a,0, a.length, 0);elsemergeSort(aux, a,0, a.length, 0, c);

}private static voidmergeSort(Object[] src,

Object[] dest,intlow,inthigh,intoff) {int length = high -low;//Insertion sort on smallest arrays

if (length low &&((Comparable) dest[j-1]).compareTo(dest[j])>0; j--)

swap(dest, j, j-1);return;

}//Recursively sort halves of dest into src

int destLow =low;int destHigh =high;

low+=off;

high+=off;int mid = (low + high) >>> 1;

mergeSort(dest, src, low, mid,-off);

mergeSort(dest, src, mid, high,-off);//If list is already sorted, just copy from src to dest. This is an//optimization that results in faster sorts for nearly ordered lists.

if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) {

System.arraycopy(src, low, dest, destLow, length);return;

}//Merge sorted halves (now in src) into dest

for(int i = destLow, p = low, q = mid; i < destHigh; i++) {if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)

dest[i]= src[p++];elsedest[i]= src[q++];

}

注>>:二进制右移，左侧补符号位，>>>:二进制右移，左侧补无符号为，也就是03.举例：public classTestCompare {privateString com;private intid;public TestCompare(intid, String com) {super();this.com =com;this.id =id;

}

@OverridepublicString toString() {return "TestCompare [com=" + com + ", id=" + id + "]";

}/***@paramargs*/

public static voidmain(String[] args) {//TODO Auto-generated method stub

List li = new ArrayList();

li.add(new TestCompare(1, null));

li.add(new TestCompare(2, "dfsd"));

li.add(new TestCompare(3, null));

li.add(new TestCompare(4, "ying"));

Collections.sort(li,new Comparator() {

@Overridepublic intcompare(TestCompare o1, TestCompare o2) {//TODO Auto-generated method stub

if (o1.com ==o2.com)return 0;else if (o1.com == null)return 1;else if (o2.com == null)return -1;else