Problem: bogosort attempts to sort a list by shuffling the items in the list. If the list is unsorted after shuffling, we continue shuffling the list and checking until it is finally sorted.
1. What is the worst case run time for bogosort? & Why?
2. What is the average case run time for bogosort (Hint: think about a deck of cards )? & Why?