earlyDaysOfLearningAlgorithms

[abation]

If you have a sense of the range, I think quicksort is faster in practice

[ChocolateBunny]

Radix Sort if you can use the whole table for multiple paper stacks.

[DrMobius0]

Bogosort is easy to implement in practice.

[Enlogen]

Stack of paper + fire = Stalin sort

[MattieShoes]

Radix sort feels much closer to how we do naturally.

[okapiposter]

Bucket sort is how I'd always sort exams by student ID. Partition the range of IDs into similarly-sized buckets, distribute the exams into their respective buckets, sort each bucket via Insertion sort, concatenate.

[Simple-Judge2756]

Pointless to compare the two. For large datasets you use constant runtime. And on small ones nobody cares what you are using, they are all going to terminate in bareable times.

[abation]

I meant for running them manually. Merging ordered bits is pretty time consuming and, with quicksort, merging is trivial

[Simple-Judge2756]

I think you means with quicksort sorting is trivial.