Sorting

Watch the real library implementation sweep the array again and again, swapping neighbors until a pass finds nothing left to swap.

Watch the real library implementation scan for the smallest remaining bar and swap it to the front, one final position per pass.

Watch the real library implementation execute line by line while it grows a sorted prefix through the array.

Watch the real library implementation insertion-sort the array at shrinking gaps, so far-apart bars move long distances in one hop.

Watch the real library implementation split the array down to single bars, then merge sorted halves back together through one auxiliary buffer.

Watch the real library implementation partition the array around pivots that land in their final slots and never move again.

Watch the real library implementation turn the array into a max heap, then retire the maximum to the end again and again.

Watch the real library implementation find natural runs, extend short ones with binary insertion, and merge them under the stack rules that keep it fast.

Watch the real library implementation sort three-digit values without a single comparison: bucket by ones, then tens, then hundreds.

Watch Batcher's odd-even merge network sort the array with a fixed schedule of compare-exchanges that never looks at the data to decide what happens next.