forked from TheAlgorithms/JavaScript
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBogoSort.js
More file actions
Latest commit
38 lines (36 loc) · 811 Bytes
/
Copy pathBogoSort.js
File metadata and controls
38 lines (36 loc) · 811 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/**
* Checks whether the given array is sorted in ascending order.
*/
exportfunctionisSorted(array){
constlength=array.length
for(leti=0;i<length-1;i++){
if(array[i]>array[i+1]){
returnfalse
}
}
returntrue
}
/**
* Shuffles the given array randomly in place.
*/
functionshuffle(array){
for(leti=array.length-1;i;i--){
constm=Math.floor(Math.random()*i)
constn=array[i-1]
array[i-1]=array[m]
array[m]=n
}
}
/**
* Implementation of the bogosort algorithm.
*
* This sorting algorithm randomly rearranges the array until it is sorted.
*
* For more information see: https://en.wikipedia.org/wiki/Bogosort
*/
exportfunctionbogoSort(items){
while(!isSorted(items)){
shuffle(items)
}
returnitems
}