Worst Sorting Algorithm Ever - #shorts

3-Second Blueprint (English)

1. Bogosort repeatedly shuffles an array at random inside a while loop and checks after every pass whether elements happen to be sorted.
2. Testing on tiny three-element lists finishes almost instantaneously because only six total permutations exist in the search space.
3. Increasing the list to just 14 numbers causes runtime to explode to nearly five hours due to factorial growth of random permutations.