Sort by

Newest

Oldest

Popular

Bucket Sort — Faster than Quick Sort. Faster than Merge Sort. If your data cooperates  #algorithms
Heap Sort — The algorithm that checks every box and still gets picked last  #algorithms #datasorting
Gnome Sort — Named after a garden gnome. Originally called Stupid Sort. Both names are correct
Selection Sort — Scans everything, picks the best, never looks back  #algorithms #codeprep
Stalin Sort — Linear time. One pass. Perfect algorithm. Until you look at the output  #algorithms
Cocktail Sort — Someone looked at Bubble Sort and said "what if it could turn around"  #algorithms
Shell Sort — The algorithm that looked at O(n²) and said "no" for the first time in history
Bitonic Sort — The algorithm that makes all its decisions before seeing a single element
Heap Sort — Does everything right and still nobody picks it first  #algorithms #datasorting #sound
Cycle Sort — Every element moves once. Exactly once. And you can prove no algorithm can do less
Gravity Sort — Let go of the data. Seriously. Just let go.  #algorithms #datasorting
Stalin Sort — O(n). One pass. Sounds perfect until you check what's missing  #algorithms
Odd-Even Sort — Bubble Sort but every comparison happens at the same time  #algorithms
Tim Sort — The sorting algorithm that got hired by every major programming language on Earth
Thanos Sort — What if the solution to an unsorted array was just... deleting most of it  #algorithms
Spaghetti Sort — An algorithm you can perform with dinner ingredients and zero electricity
Tim Sort — One guy built this for Python and now it runs on basically every device you own
Cycle Sort — The only algorithm where every single move is provably the last one possible
Gnome Sort — One while loop. No nesting. Its creator called it "Stupid Sort" and honestly, fair
Insertion Sort — You've been running this algorithm since you were a kid #algorithms #soundeffects
Cycle Sort — Every single write is mathematically guaranteed to be the last  #algorithms #asmr
Thanos Sort — Deletes everything that doesn't fit and calls it a day  #algorithms #datasorting
Comb Sort — Bubble Sort was beyond saving. Then someone tried 1.3 and everything changed  #asmr
Sleep Sort — This algorithm literally takes a nap and wakes up with the answer  #algorithms
Bitonic Sort — Every step is planned before the data even arrives. That's terrifying and beautiful
Bubble Sort — The first algorithm you'll ever write and the first one you'll outgrow  #algorithms
Quick Sort — The algorithm that won the standard library wars and it wasn't even close  #algorithms
Comb Sort — One number saved Bubble Sort from being completely useless. That number is 1.3 #codeprep
Gravity Sort — What if you just dropped the data and let physics figure it out  #algorithms #asmr
Circle Sort — A random forum post accidentally created a legitimate O(n log n) #algorithm #asmr
Heap Sort — Guaranteed O(n log n), zero extra memory, and somehow still the underdog  #algorithms
Stalin Sort — O(n) linear time, one pass, zero extra memory. There's a catch. #algorithms  #codeprep
Cocktail Sort — Bubble Sort's one obvious upgrade that nobody thought of for years
Radix Sort — Sorts millions of integers without comparing a single one. How is that even possible?
Bitonic Sort — Every comparison decided before the first element even loads   #algorithms
Pancake Sort — Bill Gates' only math paper is about flipping pancakes. I'm serious
Circle Sort — Some programmer posted this on a forum and it turned out to be O(n log n)  #algorithms
Spaghetti Sort — The only algorithm you can do with tonight's dinner  #algorithms
Shell Sort — 15 lines of code and an unsolved math problem hiding inside  #algorithms
Insertion Sort — You've been doing this your whole life, you just didn't know it had a name  #asmr
Gnome Sort — One loop. Two directions. Originally called Stupid Sort. I'm not kidding  #algorithms
Cocktail Sort — What happens when Bubble Sort learns it can go backwards  #algorithms
Radix Sort — This algorithm sorts millions of elements and never compares a single one  #algorithms
Thanos Sort — The fastest sorting algorithm that doesn't actually sort  #algorithms #codeprep
Gnome Sort — Originally called "Stupid Sort" and it only needs one loop. Seriously, one  #algorithms
Shell Sort — The first algorithm that proved O(n²) wasn't the speed limit  #algorithms
Shell Sort — The first algorithm to ever beat O(n²) and nobody saw it coming  #algorithms
Tim Sort — Python needed a sorting algorithm so they just... made one