fossilesque@mander.xyzM to Science Memes@mander.xyzEnglish · 3 months agoMarge Sortmander.xyzexternal-linkmessage-square17linkfedilinkarrow-up1402arrow-down19cross-posted to: programmer_humor
arrow-up1393arrow-down1external-linkMarge Sortmander.xyzfossilesque@mander.xyzM to Science Memes@mander.xyzEnglish · 3 months agomessage-square17linkfedilinkcross-posted to: programmer_humor
minus-squareIron Lynx@lemmy.worldlinkfedilinkEnglisharrow-up4·edit-23 months agoTbf, Merge Sort has a Big O of n log (n) in all cases, so it’s a pretty mid sorting algorithm in general, but it’s conceptually straightforward and easy to explain to newbies.
minus-squareFushuan [he/him]@lemm.eelinkfedilinkEnglisharrow-up2·3 months agoThere’s no better big O sorting method for generic lists. Heap sort has better averages but the big O is the same in the end.
Tbf, Merge Sort has a Big O of n log (n) in all cases, so it’s a pretty mid sorting algorithm in general, but it’s conceptually straightforward and easy to explain to newbies.
There’s no better big O sorting method for generic lists. Heap sort has better averages but the big O is the same in the end.