Worst: n log n Average: n log n Best: n log n
This could be a lot slower, I just made it bearable to sit through, the actual sort does Slippery Slopesort on lists of 16 elements instead of 8, this shows even though it is nlogn since it will always take a constant amount of time to sort c elements with Slippery Slopesort therefore giving linear time, it is extremely impractical in the real world due to high constant factors, this also showcases the tradeoff you make with sorting networks like the AKS sorting network and Zig Zag Sort
