Not exactly programming but...
I have a stack of 100 cards numbered 1-100. Distribution is random. With a memory restraint of the size of a desk, what is the most efficient way to sort it manually?
I did a bucket sort (into piles of 10) and then insertion sorts on the individual piles. Is there a more efficient way?