问高手一个问题：在java.util里的Arrays类里有这样一个方法是干什么的。

b104_lcs

问高手一个问题：
在java.util里的Arrays类里有这样一个方法是干什么的。

public static void sort(Object[] a,Comparator c)

Sorts the specified array of objects according to the order induced by the specified comparator. All elements in the array must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the array).
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists.

Parameters:
a - the array to be sorted.
c - the comparator to determine the order of the array. A null value indicates that the elements' natural ordering should be used.
Throws:
ClassCastException - if the array contains elements that are not mutually comparable using the specified comparator.
See Also:
Comparator

wobushiwo

public static void sort(Object[] a,Comparator c)

根据条件排a这个数组,搜一下论坛或google太多例子了，今天太累了。。。

cooljia

我在项目中写的一段代码.

1. 
   
2.         Arrays.sort(results, new Comparator () {
   
3.             public int compare(Object cmd0, Object cmd1) {
   
4.                 String tagetUri0 = ((Item)((CommandRequest)cmd0).getItems().get(0)).getTargetURI();
   
5.                 String tagetUri1 = ((Item)((CommandRequest)cmd1).getItems().get(0)).getTargetURI();
   
6.                 return tagetUri0.compareTo(tagetUri1);
   
7.             }
   
8.         });
   

复制代码