GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Sorts/BogoSort.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathBogoSort.jsMore file actions 38 lines (36 loc) · 811 Bytes / Copy pathBogoSort.jsFile metadata and controls38 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. */ 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 } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |