I'm relatively new to Sorting in Java, but I have trouble finding out which is more efficient: QuickSort , MergeSort, Heapsort. It looks like they share the same average case, while heap and merge have better worst case. Wouldn't I be safe to assume that heap is generally better to use, since merge uses extra memory? When would Heapsort be less advantageous than the other two?

This post was edited by oOn on Aug 1 2013 05:27pm

Bubble.

Relevant video I enjoyed

This post was edited by Schwag on Aug 1 2013 09:36pm

saw this last night

radix sort lsd mega sex

Ruby sort

lol i guess he gave up on the bogo sort

also failed to include these classics:
http://xkcd.com/1185/

This post was edited by Azrad on Aug 2 2013 07:25am

enjoyed

You guys aren't helping.

because there is no simple answer. It depends on what you are doing (what you are sorting, and how much you are sorting).

Under the right conditions, bubble and even bogo sort can actually beat other methods!

This post was edited by Azrad on Aug 2 2013 03:33pm