Welcome to Sort Simulator! just sort things. that's it. more sorts soon! extra points if you can get bogosort to sort a list! (im pretty sure it's near 0 chance) bucket+ seems to be the fastest added previous random button for more direct time comparisons! sorted 240 in 18.9 minutes using bucket sort! sorted 240 in 12.1 minutes using bucket+ sort! sorting 240 with any other sort might take upwards of 20 minutes. (at least on my crappy chromebook) list length: 30 bogo: upwards of several years stooge:73.7 bubble: 73.6 shell:36.8 insertion:35.8 merge: 34.5 shell+:30.6 bucket:20.2 bucket+:16.4
Current Sort Types: -bogosort- goes down the list. if a piece is out of order, then it randomizes the entire list until it's sorted. works on all size lists but don't do above 7 if you want to see it sorted by the end of the day. -bubblesort- goes down the list. if a piece is out of order, then it swaps the current piece with the next one. -bubblesort+- goes down the list. if a piece is out of order, swap the pieces and go back. I devised this one myself but I'm sure it already exists. -shellsort- like bubblesort but instead of comparing the next piece it compares a certain offset down the line. each pass shortens the offset. -shellsort+- like shellsort but it moves back one, like bubblesort+, when it switches two items. -stoogesort- sorts the first 2/3rds then the last 2/3rds then the first 2/3rds using bubble sort. -bucketsort- takes any item within a range and puts it to the left. increases the range every time it finishes the list. then it lets insertion sort clean up the impercise ramp -mergesort- splits the list into two, sorts each list, then combines them. will sort a list but inefficient due to the same pointer being used for both lists. bucketsort+: the same as bucket sort, but it counts how many items it's swapped, and skips them all, to avoid scanning over already near-sorted areas. quicksort: it's broken right now, does 3 quicksort loops with the pivot in the middle, then does bucket and then insertion sort. bogosort: terrible in all situations. bubblesort:decent in most situations. bubblesort+:great in larger sets. shellsort: great in smaller sets. shellsort+:works worse than shellsort in every situation. stoogesort: worse than bubblesort bucketsort:works slightly better than insertion sort mergesort: works amazing for lower sized lists. bucketsort+:works INSANE for larger lists.
