Parallel odd-even merge sort on ArrayV

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 sorting network made by Ken Batcher. Although it's not asymptotically optimal, Knuth concluded in 1998, with respect to the AKS network that "Batcher's method is much better, unless n exceeds the total memory capacity of all computers on earth!"
It's unstable, in-place (O(1) memory), O(log^2 n) best, average, and worst cases when fully parallel. Otherwise, O((n/p) log^2 n), where p is the number of parallel processors. In this case, this video is done with an Intel Core i7-9750H, which has 12 parallel processors.