Question

In real life, what is the fastest way to sort a deck of cards in order?

Answer 1

deal them in a line ace to king

Answer 2

but that's insertion sort :(

Answer 3

can't wait to see the answer to this!

Answer 4

im a big card player so thats how i would do it

Answer 5

yeah I hope someone comes here and gives me a real-life implementation mergesort or quicksort or heapsort or some other fancy sorting algorithm

Answer 6

I will look into this ...

Answer 7

you could be a magician

Answer 8

google? i found a couple, but since i don't understand programming it doesn't help me

Answer 9

insertion sort works something like this:

table: empty
hand: unsorted cards

put the first card of the deck on the table
the top card of the deck is now your key
put it in it's appropriate position on the table, comparing it to the single card on the table

now the next card is the key
compare it right-to-left with the cards on the table, placing it in it's appropriate position on the table (i.e. just after a card that's smaller than it)

...

in the end you have a line of sorted cards on the table, so all you do is bundle them up :-D

Insertion sort is O(n^2) though :(

Answer 10

bubble sort

Answer 11

In real life agd, you wouldn't write a computer program to do it anyway, but do it by hand. What notsmart said sounds smart to me.

Answer 12

Right

Answer 13

Insertion sort, for small n, is relatively efficient and simple, and therefore effective.