|Gmork - 2016-06-17 |
I UNDERSTAND EVERYTHING NOW
|Bort - 2016-06-17 |
Quick Sort pisses me off. It may be efficient, but any sorting algorithm that threatens to break if you have duplicate values gets the stink-eye from me. (Obviously you can supply code to handle duplicate values, but you have to handle it more like a Dreaded Potentially Lethal Error Condition rather than a perfectly ordinary situation to encounter when sorting data.)
Also, even though quick sort is the fastest with mostly random data sets, If you have a data set that is already mostly sorted (for example you only need to switch two values), It can actually be one of the least efficient sorting methods. It's a matter of knowing what kind of data you're working with and picking the right method.
True. Though if you have a relatively small number of anything to sort (like under 100), you can be pretty confident that just about any non-laughable algorithm will sort it pretty quickly, so you don't need to belabor the matter unduly. Just do an insertion sort, it's impossible to get it wrong.
We'd be the poorer without you. And our data would be less replicatable.
|That guy - 2016-06-17 |
IT'S JUST THAT EASY.
|Void 71 - 2016-06-17 |
Oh yeah, tell those naughty lines where to go.
|Killer Joe - 2016-06-17 |
LETS PLAY SCORCHED EARTH GUYS!
|Robin Kestrel - 2016-06-17 |
Yup, that's what a heap sort sounds like, all right.
|Albuquerque Halsey - 2016-06-17 |
Merge Sort is like an old lady sorting loose change.
|gravelstudios - 2016-06-17 |
Bogo sort sounds fun, but I wonder how long it would take to actually solve this problem.
An average of n! efforts, probably.
|Callamon - 2016-06-18 |
I started watching this and realized I was waay too high to handle it.
| Register or login To Post a Comment|