A condensed variant of Head Swap Sort. Performs worse, but has a smaller code size.
Algorithm showcased on @PCBoyStudios' fork of ArrayV by @Gaming32i.
Best-case performance: O(n²)
Average performance: O(2ⁿ)
Worst-case performance: O(2ⁿ)
Worst-case space complexity: O(1)
Head Swap Sort: https://youtu.be/Fzo_vWX7TxE
