How to realize Quick sort in js

This article mainly introduces how to achieve quick sorting in js, has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, the following let the editor take you to understand it.

1, partition, select a datum from the array, all elements smaller than the datum are placed in front of the datum, and elements larger than the datum are placed after the datum.

2. Partition the sub-tree groups before and after the benchmark recursively.

Example

Array.prototype.quickSort = function () {const rec = (arr) = > {if (arr.length = 1) {return arr;} const left = []; const right = []; const mid = arr [0]; for (let I = 1; I

< arr.length; i += 1) { if (arr[i] < mid) { left.push(arr[i]); } else { right.push(arr[i]); } } return [...rec(left), mid, ...rec(right)]; }; const res = rec(this); res.forEach((n, i) =>

{this [I] = n;}; const arr = [2, 4, 5, 3, 1]; arr.quickSort (); Thank you for reading this article carefully. I hope the article "how to achieve Quick sorting in js" shared by the editor will be helpful to you. At the same time, I hope you will support us, pay attention to the industry information channels, and more related knowledge is waiting for you to learn!