MapReduce里面的两种排序算法

未完待续

public final class HeapSort implements IndexedSorter 

public final class QuickSort implements IndexedSorter








public interface IndexedSorter {


  /**
   * Sort the items accessed through the given IndexedSortable over the given
   * range of logical indices. From the perspective of the sort algorithm,
   * each index between l (inclusive) and r (exclusive) is an addressable
   * entry.
   * @see IndexedSortable#compare
   * @see IndexedSortable#swap
   */
  void sort(IndexedSortable s, int l, int r);


  /**
   * Same as {@link #sort(IndexedSortable,int,int)}, but indicate progress
   * periodically.
   * @see #sort(IndexedSortable,int,int)
   */
  void sort(IndexedSortable s, int l, int r, Progressable rep);


}