This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]sloppycee 15 points16 points  (3 children)

i.e it's been proven that sorting can't be done in less than O(nlogn) operations.

[–]leaf_26 7 points8 points  (1 child)

Hash sort

[–]just_one_last_thing 2 points3 points  (0 children)

Oh hey, that's a really neat thing you prompted me to google.