edu.princeton.cs.algorithms

Class QuickX

java.lang.Object

edu.princeton.cs.algorithms.QuickX

public class QuickX
extends Object

The QuickX class provides static methods for sorting an array using an optimized version of quicksort (using Bentley-McIlroy 3-way partitioning, Tukey's ninther, and cutoff to insertion sort).

For additional documentation, see Section 2.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Author:

Robert Sedgewick, Kevin Wayne

Method Summary

Methods

Modifier and Type	Method and Description
static void	main(String[] args) Reads in a sequence of strings from standard input; quicksorts them (using an optimized version of 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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

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 quicksort); and prints them to standard output in ascending order.