sorting! beta sorting time! bubble sort - if the second value is smaller than first they are swapped insertion sort - finds where the next number in the dataset is sorted into selection sort - finds the smallest value and moves it into place merge sort - splits data in half into sublists until each sublist is one value, then combines sublists until sorted (technically working but techically not the correct version) comb sort - combs through the data with a gap value that decreases each turn by 1.3 cocktail - same thing as bubble sort but it also checks in reverse shell - it starts with a big gap and checks numbers, and decreases the gap by one gnome - similar to insertion but does with 2 values instead smart bogo - like bogo sort but it keeps sorted numbers CUSTOM SORT bogo - randomizes the order of the values until its sorted drop sort - like bubble but instead of swapping, it will drop the smallest number until it is technically sorted, but you might a few values miracle - it checks if its sorted on the first turn and if it isnt, then you better wait for a miracle fish sort - randomizes algorithm and keeps anything in order CUSTOM SORT intelligent design sort - it sorts instantly, so fast we wont know how its sorted stooge sort - sorts first 2/3rds of list, then sorts the second 2/3rds of list and this repeats until list is sorted corruption sort - similar to dropsort, but it replaces the values with the greater one instead of deleting it
merge sort works, but very laggy and also isnt the proper way it should be done planning on working on quick and maybe possibly heap sort the sorting algorithm in the title is bogo also when working on the previous beta i figured out how to do mode and that was added to my stats calculator
