algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

merge: Add Description and Optamization (#852)

Browse Source
This commit is contained in:
YATIN KATHURIA
2021-11-27 16:50:09 +05:30
committed by GitHub
parent 51415f8a12
commit cc34088aae
1 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
Sorts/QuickSort.js
View File

@ -1,9 +1,11 @@
/** /**
* Quick sort is a comparison sorting algorithm that uses a divide and conquer strategy. * @function QuickSort
* * @description Quick sort is a comparison sorting algorithm that uses a divide and conquer strategy.
* For more information see here: https://en.wikipedia.org/wiki/Quicksort * @param {Integer[]} items - Array of integers
*/ * @return {Integer[]} - Sorted array.
export function quickSort (items) { * @see [QuickSort](https://en.wikipedia.org/wiki/Quicksort)
*/
function quickSort (items) {
const length = items.length const length = items.length
if (length <= 1) { if (length <= 1) {
@ -21,9 +23,8 @@ export function quickSort (items) {
} }
} }
let sorted = quickSort(LESSER) const sorted = [...quickSort(LESSER), PIVOT, ...quickSort(GREATER)]
sorted.push(PIVOT)
sorted = sorted.concat(quickSort(GREATER))
return sorted return sorted
} }
export { quickSort }