andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update top JS snippets

Browse Source
This commit is contained in:
Chalarangelo
2021-10-13 20:09:28 +03:00
parent 2b775e3c93
commit 3cd481c0d1
19 changed files with 45 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
snippets/quickSort.md
View File

@ -2,7 +2,7 @@
title: quickSort
tags: algorithm,array,recursion,advanced
firstSeen: 2017-12-28T13:42:41+02:00
lastUpdated: 2020-12-29T13:03:18+02:00
lastUpdated: 2021-10-13T19:29:39+02:00
---
Sorts an array of numbers, using the quicksort algorithm.
@ -11,7 +11,7 @@ Sorts an array of numbers, using the quicksort algorithm.
- Use the spread operator (`...`) to clone the original array, `arr`.
- If the `length` of the array is less than `2`, return the cloned array.
- Use `Math.floor()` to calculate the index of the pivot element.
- Use `Array.prototype.reduce()` and `Array.prototype.push()` to split the array into two subarrays (elements smaller or equal to the `pivot` and elements greater than it), destructuring the result into two arrays.
- Use `Array.prototype.reduce()` and `Array.prototype.push()` to split the array into two subarrays. The first one contains elements smaller than or equal to `pivot` and the second on elements greather than it. Destructure the result into two arrays.
- Recursively call `quickSort()` on the created subarrays.
```js