BogoSort or Permutation Sort
Last Updated :
11 Jul, 2023
BogoSort also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort is a particularly ineffective algorithm one person can ever imagine. It is based on generate and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted.(Wiki) For example, if bogosort is used to sort a deck of cards, it would consist of checking if the deck were in order, and if it were not, one would throw the deck into the air, pick the cards up at random, and repeat the process until the deck is sorted.
Algorithm:
Bogo sort uses 2 steps to sort elements of the array.
1. It throws the number randomly.
2. Check whether the number is sorted or not.
3. If sorted then return the sorted array.
4. Otherwise it again generate another randomization of the numbers until the array is sorted.
PseudoCode:
while not Sorted(list) do
shuffle (list)
done
Example: Let us consider an example array ( 3 2 5 1 0 4 ) 4 5 0 3 2 1 (1st shuffling) 4 1 3 2 5 0 (2ndshuffling) 1 0 3 2 5 4 (3rd shuffling) 3 1 0 2 4 5 (4th shuffling) 1 4 5 0 3 2 (5th shuffling) . . . 0 1 2 3 4 5 (nth shuffling)------ Sorted Array Here, n is unknown because algorithm doesn’t know in which step the resultant permutation will come out to be sorted.
C++
// C++ implementation of Bogo Sort
#include <bits/stdc++.h>
using namespace std;
// To check if array is sorted or not
bool isSorted(int a[], int n)
{
while (--n > 0)
if (a[n] < a[n - 1])
return false;
return true;
}
// To generate permutation of the array
void shuffle(int a[], int n)
{
for (int i = 0; i < n; i++)
swap(a[i], a[rand() % n]);
}
// Sorts array a[0..n-1] using Bogo sort
void bogosort(int a[], int n)
{
// if array is not sorted then shuffle
// the array again
while (!isSorted(a, n))
shuffle(a, n);
}
// prints the array
void printArray(int a[], int n)
{
for (int i = 0; i < n; i++)
cout << a[i] << " ";
cout << "\n";
}
// Driver code
int main()
{
int a[] = { 3, 2, 5, 1, 0, 4 };
int n = sizeof a / sizeof a[0];
bogosort(a, n);
printf("Sorted array :\n");
printArray(a, n);
return 0;
}
Java
// Java Program to implement BogoSort
public class BogoSort {
// Sorts array a[0..n-1] using Bogo sort
void bogoSort(int[] a)
{
// if array is not sorted then shuffle the
// array again
while (isSorted(a) == false)
shuffle(a);
}
// To generate permutation of the array
void shuffle(int[] a)
{
// Math.random() returns a double positive
// value, greater than or equal to 0.0 and
// less than 1.0.
for (int i = 1; i < a.length; i++)
swap(a, i, (int)(Math.random() * i));
}
// Swapping 2 elements
void swap(int[] a, int i, int j)
{
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
// To check if array is sorted or not
boolean isSorted(int[] a)
{
for (int i = 1; i < a.length; i++)
if (a[i] < a[i - 1])
return false;
return true;
}
// Prints the array
void printArray(int[] arr)
{
for (int i = 0; i < arr.length; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
public static void main(String[] args)
{
// Enter array to be sorted here
int[] a = { 3, 2, 5, 1, 0, 4 };
BogoSort ob = new BogoSort();
ob.bogoSort(a);
System.out.print("Sorted array: ");
ob.printArray(a);
}
}
Python
# Python program for implementation of Bogo Sort
import random
# Sorts array a[0..n-1] using Bogo sort
def bogoSort(a):
n = len(a)
while (is_sorted(a) == False):
shuffle(a)
# To check if array is sorted or not
def is_sorted(a):
n = len(a)
for i in range(0, n-1):
if (a[i] > a[i+1]):
return False
return True
# To generate permutation of the array
def shuffle(a):
n = len(a)
for i in range(0, n):
r = random.randint(0, n-1)
a[i], a[r] = a[r], a[i]
# Driver code to test above
a = [3, 2, 4, 1, 0, 5]
bogoSort(a)
print("Sorted array :")
for i in range(len(a)):
print("%d" % a[i]),
C#
// C# implementation of Bogo Sort
using System;
class GFG {
// To Swap two given numbers
static void Swap<T>(ref T lhs, ref T rhs)
{
T temp;
temp = lhs;
lhs = rhs;
rhs = temp;
}
// To check if array is sorted or not
public static bool isSorted(int[] a, int n)
{
int i = 0;
while (i < n - 1) {
if (a[i] > a[i + 1])
return false;
i++;
}
return true;
}
// To generate permutation of the array
public static void shuffle(int[] a, int n)
{
Random rnd = new Random();
for (int i = 0; i < n; i++)
Swap(ref a[i], ref a[rnd.Next(0, n)]);
}
// Sorts array a[0..n-1] using Bogo sort
public static void bogosort(int[] a, int n)
{
// if array is not sorted then shuffle
// the array again
while (!isSorted(a, n))
shuffle(a, n);
}
// prints the array
public static void printArray(int[] a, int n)
{
for (int i = 0; i < n; i++)
Console.Write(a[i] + " ");
Console.Write("\n");
}
// Driver code
static void Main()
{
int[] a = { 3, 2, 5, 1, 0, 4 };
int n = a.Length;
bogosort(a, n);
Console.Write("Sorted array :\n");
printArray(a, n);
}
// This code is contributed by DrRoot_
}
JavaScript
<script>
// Javascript program for implementation of Bogo sort
// To check if array is sorted or not
function isSorted(a, n){
for(var i = 1; i < arr.length; i++)
if (a[i] < a[i-1])
return false;
return true;
}
//swap function
function swap(arr, xp, yp){
var temp = arr[xp];
arr[xp] = arr[yp];
arr[yp] = temp;
}
// To generate permutation of the array
function shuffle(a, n){
var i, j=n;
for (i=0; i < n; i++){
var ind = Math.floor(Math.random() * n);
swap(a, j-i-1, ind);
}
return a;
}
// Sorts array a[0..n-1] using Bogo sort
function bogosort(a, n){
// if array is not sorted then shuffle
// the array again
while (!isSorted(a, n))
a = shuffle(a, n);
return a;
}
// prints the array
function printArray(arr, size){
var i;
for (i=0; i < size; i++)
document.write(arr[i]+ " ");
document.write("\n");
}
// Driver code
var arr = [3, 2, 5, 1, 0, 4];
var n = arr.length;
arr = bogosort(arr, n);
document.write("Sorted array: \n");
printArray(arr, n);
// This code is contributed by Susobhan Akhuli
</script>
OutputSorted array :
0 1 2 3 4 5
Time Complexity:
- Worst Case : O(?) (since this algorithm has no upper bound)
- Average Case: O(n*n!)
- Best Case : O(n)(when array given is already sorted)
Auxiliary Space: O(1)
Bozo Sort Algorithm:
Bozo sort is a variation of Bogo sort and is little more efficient than Bogo sort.
Check if the array is sorted or not.
Unlike bogo sort, if the list/array is not sorted then it picks only two items at random and swap them.
Then it checks if the array/list is sorted or not.
But like bogo sort, there is chance that it faces the same pseudo-random problems and it may never terminate.
It means it also has O(?) worst time complexity but its average case complexity is better than Bogo sort.
Question:
1. Tell the other names of Bogo sort?
Ans. Bogo sort has many other names like, permutation sort, slow sort, shotgun sort, stupid sort, bozo sort, blort sort, monkey sort, random sort or drunk man sort.
2. Why Bogo sort is called stupid sort, bozo sort, blort sort, monkey sort, random sort or drunk man sort?
Ans. Complexity of Bogo sort is O(?) since this algorithm has no upper bound. So, you can imagine how much inefficient this sorting algorithm is. That's why for its tremendous inefficiency, it is jokingly called stupid sort, bozo sort, blort sort, monkey sort, random sort or drunk man sort.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to [email protected]. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Similar Reads
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to Sorting Techniques â Data Structure and Algorithm Tutorials Sorting refers to rearrangement of a given array or list of elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure. Why Sorting Algorithms are ImportantThe sorting algorithm is important in Com
3 min read
Most Common Sorting Algorithms
Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an
8 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
12 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Heap Sort - Data Structures and Algorithms Tutorials Heap sort is a comparison-based sorting technique based on Binary Heap Data Structure. It can be seen as an optimization over selection sort where we first find the max (or min) element and swap it with the last (or first). We repeat the same process for the remaining elements. In Heap Sort, we use
14 min read
Counting Sort - Data Structures and Algorithms Tutorials Counting Sort is a non-comparison-based sorting algorithm. It is particularly efficient when the range of input values is small compared to the number of elements to be sorted. The basic idea behind Counting Sort is to count the frequency of each distinct element in the input array and use that info
7 min read