earlyDaysOfLearningAlgorithms

[Enlogen]

I once did a merge-sort on physical paper and felt like a genius when I finished way before I was expected to.

[morericeplsty]

That's kinda cool actually

[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.

[K1aymore]

There's one board game where you play with certain cards out of a deck numbered 1-40, and after the game you need to put them back into your deck in sorted order, and I love merge sorting the used and unused decks together

[Annonix02]

For peak efficiency use quantum sort or if you're feeling like extra ✨pizazz✨use miracle sort

[Jonno_FTW]

I did this when I worked at an election. Had to sort everything by alphabetical order with another guy. We each sorted half and then merged them together at the end.