Two parts of a list are merged together using the Half-Buffer Merging Algorithm. Space to make a new list. S to sort. Sequel: https://scratch.mit.edu/projects/124826200/
An optimization for iterative merge sort.
