Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 10 additions & 9 deletions Sorts/QuickSort.js
Original file line number Diff line number Diff line change
@@ -1,9 +1,11 @@
/**
* 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
*/
export function quickSort (items) {
* @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) {
Expand All @@ -21,9 +23,8 @@ export function quickSort (items) {
}
}

let sorted = quickSort(LESSER)
sorted.push(PIVOT)
sorted = sorted.concat(quickSort(GREATER))

const sorted = [...quickSort(LESSER), PIVOT, ...quickSort(GREATER)]
return sorted
}

export { quickSort }