Fantastic sorting algorithm, O(1) runtime, so amazing

  • 2
    You gotta admit though it is the fastest sorting algorithm you have ever seen...
  • 0
    But what about my bogobogo sort?
    It is only O(n!)
  • 2
    Maybe that's just a placeholder until the function is actually implemented...
  • 0
    @kamen this! I also do this often, but I also put in TODO message above it so the next coder knows
  • 0
    At least is stable and doesn't need random shuffling!
Add Comment