this project visualizes and audibilizes some sorting algorithms computers use to sort lists. the array is 128 numbers long with values 0-127. (you will be able to change this soon!) to run sorts: 1 for bubble sort 2 for cocktail shaker sort 3 for selection sort 4 for insertion sort 5 for merge sort 6 for bottomup merge sort 7 for weave mergesort 8 for comb sort 9 for odd-even sort 0 for counting sort q for lr quicksort w for ll quicksort e for dual pivot quicksort r for binary insertion sort s for shellsort p for pigeonhole sort l for lsd radix sort m for msd radix sort f for flashsort h for max heapsort j for min heapsort k for smoothsort g for gnome sort b for bitonic sort z for bogosort c for cycle sort i for introsort v for slow sort x for stooge sort list inputs: click the button that says "shuffles" to choose different inputs press the bottom-right button for different visualizers more sorts to come! currently working on: -smoothsort
my brother for helping me all sorts coded from scratch by me and my brother heavily based off of ArrayV and The Sound of Sorting turbowarp: https://turbowarp.org/889127288?hqpen&fps=80 speeds things up a lot and makes it better
