Package edu.princeton.cs.algs4
Class QuickX
 Object

 edu.princeton.cs.algs4.QuickX

public class QuickX extends Object
TheQuickX
class provides static methods for sorting an array using an optimized version of quicksort (using Hoare's 2way partitioning algorithm, medianof3 to choose the partitioning element, and cutoff to insertion sort).For additional documentation, see Section 2.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
 Author:
 Robert Sedgewick, Kevin Wayne


Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static void
main(String[] args)
Reads in a sequence of strings from standard input; quicksorts them (using an optimized version of 2way quicksort); and prints them to standard output in ascending order.static void
sort(Comparable[] a)
Rearranges the array in ascending order, using the natural order.



Method Detail

sort
public static void sort(Comparable[] a)
Rearranges the array in ascending order, using the natural order. Parameters:
a
 the array to be sorted

main
public static void main(String[] args)
Reads in a sequence of strings from standard input; quicksorts them (using an optimized version of 2way quicksort); and prints them to standard output in ascending order. Parameters:
args
 the commandline arguments

