algorithmsdemo.java

java2参考大全上的例子的源码和自己的理解.

package 逆向进行比较;

/**
 该程序创建和初始化了一个链表。reverseOrder( )
 方法返回一个对Integer对象的比较进行逆向的Comparator函数。列表中的元素按照这个比较
 函数进行排序并被显示出来。接下来，调用shuffle( )方法对列表进行随机排列。然后显示
 列表的最大和最小值。

 List sorted in reverse: 20 8 -8 -20
List shuffled: -20 -8 20 8
Minimum: -20
Maximum: 20
 */

// Demonstrate various algorithms.
import java.util.*;

class AlgorithmsDemo {
  public static void main(String args[]) {

    // Create and initialize linked list
    LinkedList ll = new LinkedList();
    ll.add(new Integer( -8));
    ll.add(new Integer(20));
    ll.add(new Integer( -20));
    ll.add(new Integer(8));

    // Create a reverse order comparator
    Comparator r = Collections.reverseOrder();

    // Sort list by using the comparator
    Collections.sort(ll, r);

    // Get iterator
    Iterator li = ll.iterator();

    System.out.print("List sorted in reverse: ");
    while (li.hasNext()) {
      System.out.print(li.next() + " ");
    }
    System.out.println();

    Collections.shuffle(ll);

    // display randomized list
    li = ll.iterator();
    System.out.print("List shuffled: ");
    while (li.hasNext()) {
      System.out.print(li.next() + " ");
    }
    System.out.println();

    System.out.println("Minimum: " + Collections.min(ll));
    System.out.println("Maximum: " + Collections.max(ll));
  }
}