This is a sorting algorithm. Simply enter a number at the start to determine the range of numbers generated, 1 to n (your number), then enter the length of the list you want generated. You get a few seconds to look at the randomly generated list, and then get to watch the algorithm sort the list in a small amount of time.
-Big list sizes take a lot of time to complete, as it requires first comparing all the items and then repeating the entire process by the huge list size you've put then. -The list goes from the smallest to largest number, smallest at top, largest at bottom. -The entire list is randomly generated with the 'generate random number' operation. -It works by comparing items n and n+1, then moving n under n+1 to slot n+2 if n is bigger than n+1. Cycle repeats until every item has been compared, but because of numbers of the same value that might generate next to each other and bug the system, I made the process of comparing items down the entire list repeat by the length of the list.
