JavaScript/Sorts/BogoSort.js at master · TheAlgorithms/JavaScript · GitHub

38 lines (36 loc) · 811 Bytes

/**

* Checks whether the given array is sorted in ascending order.

export function isSorted(array) {

const length = array.length

for (let i = 0; i < length - 1; i++) {

if (array[i] > array[i + 1]) {

return false

}

return true

}

/**

* Shuffles the given array randomly in place.

function shuffle(array) {

for (let i = array.length - 1; i; i--) {

const m = Math.floor(Math.random() * i)

const n = 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

export function bogoSort(items) {

while (!isSorted(items)) {

shuffle(items)

}

return items

}

Expand file tree