Base 10, of course.
This time, I have an actual sorting thread in the style of Musicombo's streams, provided by Gaming32 via Discord. Download it here at https://pastebin.com/jJT7mRSt and move it into src/threads/ in the ArrayV folder, then press CTRL+F and type "timsort" and replace "timsort" in the script with whichever algorithm you want to use. Then, open up src/prompts/SortPrompt.java and add the following code in loadSortThreads():
categorySortThreads.put("Some sort thread", new RunSomeSortThread (ArrayVisualizer));

Then, download and move this https://pastebin.com/LpUf38B8 into src/sorts/. Then, open up your terminal (command prompt or Powershell on Windows), CD to the ArrayV folder, then enter "ant".
This thread is modified to include all the available shuffles.

A rather impractical sorting algorithm as it's O(n^2) best case. It's only "fast" in this video because the delay is set to very low. It's best known for its mesmerizing and satisfying sound when on base 10, especially in w0rthy's original array visualizer. This implementation is O(n^2 logbase(b) max) average and worst case, O(b) memory, and stable. b = base.