fossilesque@mander.xyzM to Science Memes@mander.xyzEnglish · 6 days agoMarge Sortmander.xyzimagemessage-square17fedilinkarrow-up1417arrow-down111cross-posted to: programmer_humor@programming.dev
arrow-up1406arrow-down1imageMarge Sortmander.xyzfossilesque@mander.xyzM to Science Memes@mander.xyzEnglish · 6 days agomessage-square17fedilinkcross-posted to: programmer_humor@programming.dev
minus-squareIron Lynx@lemmy.worldlinkfedilinkEnglisharrow-up4·edit-25 days 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 days 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.