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/QuickSort.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathQuickSort.jsMore file actions 30 lines (26 loc) · 705 Bytes / Copy pathQuickSort.jsFile metadata and controls30 lines (26 loc) · 705 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 /** * @function QuickSort * @description Quick sort is a comparison sorting algorithm that uses a divide and conquer strategy. * @param {Integer[]} items - Array of integers * @return {Integer[]} - Sorted array. * @see [QuickSort](https://en.wikipedia.org/wiki/Quicksort) */ function quickSort(items) { const length = items.length if (length <= 1) { return items } const PIVOT = items[0] const GREATER = [] const LESSER = [] for (let i = 1; i < length; i++) { if (items[i] > PIVOT) { GREATER.push(items[i]) } else { LESSER.push(items[i]) } } const sorted = [...quickSort(LESSER), PIVOT, ...quickSort(GREATER)] return sorted } export { quickSort } |
| 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. |