The Bogosort is considered one of the least effective sorting algorithms. It functions by creating random arrangements of given values and randomly moving them until they are sorted. It is not effective for any form of sorting.
Algorithm[change | change source]
The Bogosort first takes in a set of values from a user. Next it randomly arranges these values. If the values are now in a sorted order, then the function is finished, else the function repeats itself.
A working analogy for the Bogosort is to sort a deck of cards by throwing them into the air, picking them up at random, and repeating the process until they are sorted.
Implementation[change | change source]
- Have a set of values to test.
- Sort using Bogo (Randomly arrange values).
- Check if the new arrangement of values is sorted.
- If sorted, then end the function.
- If not sorted, then repeat step 2.
Simple Example[change | change source]
Array = (3,1 ,5 ,7 ,8 ,9)
1st shuffling = (1,3,7,8,9,5)
2nd shuffling = (3,7,8,6,9,1)
3rd shuffling = (7,6,3,8,9,1)
4th shuffling = (6,7,8,9,3,1)
5th shuffling = (3,6,7,8,9,1)
(continued shuffling) ...
(After final shuffling): Sorted Array = (1,3,6,7,8,9)
Coding Example[change | change source]
The following code is done in Python 3:
import random 2 3 def is_sorted(data): 4 for i in range(len(data) - 1): 5 if data[i] > data[i + 1]: 6 return False 7 return True 8 9 def bogosort(data):
10 while not is_sorted(data): 11 random.shuffle(data) 12 return data