Possibly the WORST Possible Sort Algorithm?

Here is a prime example of an algorithm that is simple to describe, and is easily understood, but its order of complexity reveals that it is way beyond feasibility.

The Las Vegas Card Sort is an O(n!) sort:

  1. Throw the cards on the table.
  2. Shuffle at random.
  3. Pick up into deck.
  4. If in order stop
    • Otherwise repeat from step 1.

[Prev][TOC][Next]


CS1104 Main Page

Last updated 2000/07/28
From Richard Botting by e-mail 2000/07/28.