Toggle navigation
Algorithm Zone
Algorithms
Algorithm Contributors
Languages
Tags
100 doors problem
10 harshad number
99 bottles problem
a star search
ackermann
alpha beta pruning
average
bellman ford search
best first search
binary search
binary search tree
bloom filter
bogobogosort
bogosort
boyer moore horspool
bozosort
breadth first search
brent cycle detection algorithm
bresenham based supercover line
bresenham line
bubble sort
burrows wheeler transform
caesar cipher
catalan numbers
chebyshev distance
cocktail sort
collatz chain
comb sort
convex hull
counterfeit coin problem
counting sort
cryptography
decimal to fraction
dekkers algorithm
depth first search
depth limited search
derivative
dijkstra search
egyptian fractions
einstein puzzle
euclidean norm
euclidean algorithm
euclidean distance
factorial
fast inv sqrt
fibonacci series
fisher-yates
floyd cycle detection algorithm
floyd warshall
gale shapely
gauss seidel algorithm
gnome sort
golden ratio algorithms
hamming code
hamming distance
hamming weight
happy number
heap sort
huffmancoding
insertion sort
interesection of points
iterative deepening depth first search
johnson search
josephus problem
kmeans clustering
knapsack
knuth morris pratt
kruskal minimum spanning tree
lempel ziv welch
levenshtein distance
bogosort
See On Github
Tweet
Data
Contributor
by jcla1
in python
Tags
exchange sort
,
sorting
Source Code
bogosort.py
from random import shuffle def bogosort(arr): while not sorted(arr) == arr: shuffle(arr) return arr