• Iron Lynx@lemmy.world
    link
    fedilink
    English
    arrow-up
    3
    ·
    edit-2
    17 hours ago

    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.