Press the green flag to generate a new set of 256 random items. Click to sort the list. Click again to redistribute the items throughout the unsorted list.
This version of the merge sort has linear best case time complexity as it searches for sorted sub- lists already present.
