sorting standard poker decks .
Alice, Bob, and Charlie are allAlice looks through the deck until she finds the ace of hearts, then sets it aside and starts over. Now she looks for the two of hearts until she finds it, then sets it aside. She continues in this way until she's put the cards in order.
Bob first sorts the cards into piles by suit (4 piles) and only then sorts them into their final order.
Charlie decides to sort the cards into piles by number instead of by suit before the final sort (13 piles).
The actions they take in sorting the cards take the following amounts of time:
If they were given randomly shuffled decks to sort, in what order would we expect them to finish?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
based on these configurations, with 1000 data Selection sort is the slowest, then Bucket Sort with 13 bucket, then the fastest is Bucket Sort with 4 bucket.
so the answer is Bob, Charlie, and Alice (see also http://en.wikipedia.org/wiki/Sorting_algorithm)