Watch it do its thingy Claude.ai said it's "Selection sort's and Bubble sort's offspring" How it works: -Set the first item with pointer A -Move forwards in the list with pointer B -If value of pointer B < value of pointer A then swap values -move pointer B until end of list while repeating steps -move pointer A a single item up -rinse and repeat until end of list
Claude.ai said it's O(n^2) time complexity for all, but it's NOT stables sadly :(| I recommend turbo mode It makes a cool backwards list shape near the end here: turbowarp.org/1184288968/
