Where efficiency goes to die and creativity flourishes. Behold the most wonderfully terrible ways to sort an array!
🐒 BogoSort (Monkey Sort)
Randomly shuffle the array. Is it sorted? Great! If not, shuffle again. And again. And again...
Time Complexity: O((n+1)!) average case. Could take forever! 🤞
😴 Sleep Sort
Create a thread for each number that sleeps for that many seconds, then prints itself. Sorting by patience!
Time Complexity: O(max(input)) wall-clock time. Literally wait for the biggest number.
🌌 Quantum BogoSort
Generate a random permutation using quantum entropy. If not sorted, destroy the universe. In the multiverse, there's always a timeline where it worked!
Time Complexity: O(1) in the universe where it works. ∞ everywhere else.
💥 UNIVERSE DESTROYED 💥
🔴 Stalin Sort
Scan through the array. Any element smaller than the previous one gets "eliminated" (removed). What remains is technically sorted!
Time Complexity: O(n). Highly efficient! Just, uh, destroys your data...