1. Run ant.bat before run.bat inside the main folder (after fixing some source codes)
2. Simply import this project in Eclipse IDE for Java and run ArrayVisualizer.java

• Visualize over 90 algorithms with 12 different visual style
• Customize sound with your own soundfont (.sf2, .sfz, .dls format)
• Toggle end sweep animation (was inspired with Timo Bingmann's Sound of Sorting)
• Adjust speed and cancel delay
• Various inputs available (random, ascending, descending, etc.)
• Sort up to 32768 (2^15) items!
• ...and lots of more!

Currently 83 sorts are in "Run All Sorts" queue

This list includes all sorts were already in arrayV v3.5 (+ some more official sorts)

• Bubble / Optimized Bubble Sort
• Cocktail Shaker / Optimized Cocktail Shaker Sort
• Odd-Even Sort
• Gnome / Optimized Gnome Sort, Opti. Gnome Sort w/ Binary Search
• Comb Sort / 3-smooth Comb Sort
• Circle Sort
• LL Quick Sort (Leftmost Pivot, Rightmost Pivot)
• LR Quick Sort (Center Pivot, Random Pivot)
• Dual-Pivot Quick Sort
• Stable Quick Sort

• Selection / Double Selection Sort
• Cycle Sort
• Max / Min / Flipped Min / Weak / Ternary Heap Sort
• Smooth Sort / Poplar Heap Sort
• Tournament Sort
• Pancake Sorting (this is classified as 'Miscellaneous Sort' when running all sorts)

• Insertion / Binary Insertion Sort
• Shell Sort
• Patience Sort
• (Unbalanced) Tree Sort

• Merge Sort (out-of-place)
• Bottom-Up Merge Sort
• In-Place Merge Sort
• Lazy Stable Sort
• Rotate Merge Sort (in-place)
• Andrey Astrelin's In-Place Merge Sort

• Counting / Pigeonhole Sort
• Gravity(Bead) Sort
• American Flag Sort
• LSD / In-Place LSD / MSD Radix Sort
• Flash Sort
• Iterative / Recursive Binary Quick Sort
• Time Sort

• Iterative / Recursive Bitonic Sort
• Iterative / Recursive Odd-Even Merge Sort
• Iterative / Recursive Pairwise Sorting Network
• Iterative / Recursive Bose-Nelson Sorting Network

• Hybrid Comb Sort
• Introspective Circle Sort
• Binary Merge Sort
• Weave Merge Sort (aka Merge-Insertion Sort)
• Tim Sort
• Cocktail Merge Sort
• Wiki / Grail / Sqrt Sort (block merge sorts!)
• Introspective Sort [std::sort]
• Optimized Bottom-Up Merge Sort [std::stable_sort] (~2012)
• STL's std::stable_sort (2013~)
• Optimized Dual-Pivot Quick Sort [Arrays.sort]
• Branched / Branchless Pattern Defeating Quick Sort

NOTE: Beware; even in a high speed, these sorts may not finish in reasonable time

Try these in less than item count inside parentheses

• Bad Sort (2048)
• Stooge Sort (1024)
• Silly / Slow Sort (256)
• Exchange Bogo / Bubble Bogo Sort (512)
• Less Bogo / Cocktail Bogo Sort (512)
• Bogo Sort (10)
• Bogo Bogo Sort (6)

• Original project by: w0rthy
• Revamped by: MusicTheorist
• Re-Revamped by: mg-2018