Comment on Marge Sort
Iron_Lynx@lemmy.world 2 weeks agoTbf, Merge Sort has a Big O of n log (n) in all cases, so its a pretty mid sorting algorithm in general, but it’s conceptually straightforward and easy to explain to newbies.
Comment on Marge Sort
Iron_Lynx@lemmy.world 2 weeks agoTbf, Merge Sort has a Big O of n log (n) in all cases, so its a pretty mid sorting algorithm in general, but it’s conceptually straightforward and easy to explain to newbies.
fushuan@lemm.ee 1 week ago
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.