Bottom-up

Sort List Bottom-Up — O(1) Space Merge Sort

Sort a linked list in O(n log n) time and O(1) space using bottom-up merge sort with doubling sublist sizes.