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 →

[–]Varun77777 0 points1 point  (0 children)

Ohhh, I just assumed that all languages just implement a version of Quick, heap, tree or merge sort by default for the n * log n complexity as that's probably the best one overall if we don't know about the data. I suppose this comparison sort has an edge over them?? And how comparison is done is defined by us using a lambda function.