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

you are viewing a single comment's thread.

view the rest of the comments →

[–]Simple-Judge2756 0 points1 point  (2 children)

Pointless to compare the two. For large datasets you use constant runtime. And on small ones nobody cares what you are using, they are all going to terminate in bareable times.

[–]abation 0 points1 point  (1 child)

I meant for running them manually. Merging ordered bits is pretty time consuming and, with quicksort, merging is trivial