Click on each cat to get the time of how long it takes to sort the list.
This is my own sorting algorithm, which is a hybrid algorithm, combining insertion sort with a form of selecting the last item in each group of the insertion sorted areas, and it finds the largest value. It repeats this over and over again, with a variable to decrease the "spikes" of choosing the largest value in the group and swapping it to the end, and the loop repeats until it reaches the end of the list or a certain point.
