After many blocks, many debugging sessions, a new partitioning scheme invented by me, many hours trying to figure out how to move around the pivots, I did it. I created what i think is the first Triple-Pivot Quicksort on Scratch. This implementation falls back on insertion sort for small lists. HOW I CREATED THE PARTITIONING SCHEME: I first took Quicksort LL Pointers, using the idea of a rightmost “scanner” pointer sorting the selected item into the boundaries of each section, to create Dual-Pivot Quicksort LLL pointers. By extending Dual-Pivot Quicksort LLL pointers by adding a pointer sweeping from the right (which the “scanner” pointer swaps to if the item is greater than the 3rd pivot), I created a triple-pivot partitioning scheme using 3 pointers coming from the left, and 1 from the right.
