@[email protected]M to Science [email protected]English • 1 day agoMarge Sortmander.xyzimagemessage-square16fedilinkarrow-up1382arrow-down111cross-posted to: [email protected]
arrow-up1371arrow-down1imageMarge Sortmander.xyz@[email protected]M to Science [email protected]English • 1 day agomessage-square16fedilinkcross-posted to: [email protected]
minus-squareIron LynxlinkEnglish2•edit-24 hours 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.
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.