Aphitorite's Method

Aphitorite's Method is an extremely complex and as of unfinished sorting algorithm that achieves $$O(n \log n)$$ worst case comparisons, $$O(n)$$ moves, and $$O(1)$$ space while also being Stable and deterministic (meaning no randomness). It is a variant of Franceschini's method.