Marge Sort

Comments

• Eheran@lemmy.world ⁨5⁩ ⁨days⁩ ago

  How does the last step sort an of the sizes? Why even have all the other steps if that one can do it all?

  source

  • Ravi@feddit.org ⁨4⁩ ⁨days⁩ ago

    The one and only way to learn sorting algorithms: youtu.be/dENca26N6V4?si=pDZoR0uRiuGoqwkr

    source

    • bitjunkie@lemmy.world ⁨4⁩ ⁨days⁩ ago

      I’d watch this if I didn’t know about programming just for the sheer weirdness

      source
  • Iron_Lynx@lemmy.world ⁨4⁩ ⁨days⁩ ago

    If you want to zipper two sorted lists, you compare the first element of each list, pick that first, take the next element of that list, rinse & repeat until one list runs out and then just chuck the entire rest of the other list in the remaining space, even if that’s just one element. Since your two initial lists are already sorted, you can trust the combined list to also be sorted.

    source

    • Eheran@lemmy.world ⁨4⁩ ⁨days⁩ ago

      So the point is that always only exactly 2 elements are compared and so you first have to split everything into groups of 2. Seems very inefficient for larger datasets, since you need to handle every single item over and over again and compare so so often. But not a sorting and comparison expert, so no idea if human sorting logic applies at all.

      source
  • CaptainBlagbird@lemmy.dbzer0.com ⁨4⁩ ⁨days⁩ ago

    youtu.be/es2T6KY45cA

    source
• cholesterol@lemmy.world ⁨4⁩ ⁨days⁩ ago

  Step 4 seems to do nothing?

  source