For every iteration, the "Initial" list just generates a random list containing the whole numbers 1 through 16 (inclusive). If it is in order (1, 2, 3, 4, 5, ... , n), then the list shows the correct list. For example, if n = 16, there is literally a 1/(16!) chance the list is correct for a given iteration, or an approximate 4.78 × 10⁻¹⁴ % = 0.0000000000000478% (13 zeros) chance. Click the space bar to start the algorithm.
"BozoSort" - A friend The "Time" updates everytime the list completes one iteration, so for lists of length 500 and above, the timer may seem jittery
