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/OddEvenSort.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathOddEvenSort.jsMore file actions 34 lines (31 loc) · 887 Bytes / Copy pathOddEvenSort.jsFile metadata and controls34 lines (31 loc) · 887 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 /* odd–even sort or odd–even transposition sort is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics. for more information : https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort */ // Helper function to swap array items function swap(arr, i, j) { const tmp = arr[i] arr[i] = arr[j] arr[j] = tmp } export function oddEvenSort(arr) { let sorted = false while (!sorted) { sorted = true for (let i = 1; i < arr.length - 1; i += 2) { if (arr[i] > arr[i + 1]) { swap(arr, i, i + 1) sorted = false } } for (let i = 0; i < arr.length - 1; i += 2) { if (arr[i] > arr[i + 1]) { swap(arr, i, i + 1) sorted = false } } } return arr } |
| 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. |