@[email protected]M to Science [email protected]English • 1 month agoMarge Sortmander.xyzimagemessage-square17fedilinkarrow-up1398arrow-down111cross-posted to: [email protected]
arrow-up1387arrow-down1imageMarge Sortmander.xyz@[email protected]M to Science [email protected]English • 1 month agomessage-square17fedilinkcross-posted to: [email protected]
minus-squareIron LynxlinkEnglish4•edit-21 month 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]linkfedilinkEnglish2•30 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.