Algorithm Comparison
Bubble Sort
Bogosort
Bubble Sort - O(n²)
1. Compare adjacent elements
2. Swap if they're in wrong order
3. Repeat until no swaps needed
4. Guaranteed to finish in O(n²) time
Bogosort - O((n+1)!)
1. Check if array is sorted
2. If not, randomly shuffle the array
3. Repeat until sorted by chance
4. Expected time: factorial complexity!
