Press space or tap the stage to shuffle the list, then again to sort it. Warning: The visual will make sound I'd only recommend using mergesort if you need a stable sort. Otherwise, I'd recommend using my quicksort implementation: https://scratch.mit.edu/projects/391085754/ This is the fastest mergesort I've seen on Scratch. This also isn't the fastest for already-sorted or equal arrays. While there are some optimizations to reduce the sorting time for sorted arrays, they aren't as effective due to the way this sort works. I've called this "fast mergesort" because this uses a somewhat weird algorithm that I haven't seen before, although I wouldn't be surprised if it already existed. This works by recursively alternating between merging subarrays into either the original array or an auxiliary array. When merging into the original array, the left half will be recursively merged into the auxiliary array and the right half will be merged into the original array before merging. The opposite is true when merging into the auxiliary array. When the size of the subarray is 16 items or less, insertion sort is used to sort the items into either the original array or auxiliary array. The auxiliary array is half the size (rounded down) of the original array.
