A ‘real’ O(1) sorting algorithm 🤣
You must log in or # to comment.
O(n^n)So… … a sorting algorithm that uses a wankton of energy and gets the sort order wrong sometimes. Um… why, though?
I still recall to this day, one of my university tutors talking about the C fastmath compiler directive: “I do not need a computer to arrive very, very quickly at the wrong answer; I can do that myself.”
It’s good to see that with applications of modern comp-sci we have graduated to arriving very, very slowly and at great expense at the wrong answer.
