edu.princeton.cs.algorithms

Class Knuth

java.lang.Object

edu.princeton.cs.algorithms.Knuth

public class Knuth
extends Object

The Knuth class provides a client for reading in a sequence of strings and shuffling them using the Knuth (or Fisher-Yates) shuffling algorithm. This algorithm guarantees to rearrange the elements in uniformly random order, under the assumption that Math.random() generates independent and uniformly distributed numbers between 0 and 1.

For additional documentation, see Section 1.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, shuffles them, and prints out the results.
static void	shuffle(Object[] a) Rearranges an array of objects in uniformly random order (under the assumption that Math.random() generates independent and uniformly distributed numbers between 0 and 1).

Methods inherited from class java.lang.Object

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

Method Detail

shuffle

public static void shuffle(Object[] a)

Rearranges an array of objects in uniformly random order (under the assumption that Math.random() generates independent and uniformly distributed numbers between 0 and 1).

Parameters:

a - the array to be shuffled

See Also:

StdRandom

main

public static void main(String[] args)

Reads in a sequence of strings from standard input, shuffles them, and prints out the results.