Bogo Sort

Time Complexity: O((n+1)!)

Space Complexity: O(1)

Process

Randomly shuffle the elements in the list and check if they are sorted. If not, shuffle again and repeat until the list is sorted.

Efficiency

Highly inefficient and impractical. It has a very high time complexity and is not suitable for real-world use.

Enter Array Size Time: N/A Swaps: N/A

Enter a number between 1 and 5.

Receiving sort data

Sort data received!