Fast Sort algorithm JavaScript implementation

1. function Quicksort (arr) {
2. function Q (start,end) {
3. if (start>=end) {return;}
4. var pivot = start,
5. temp = Arr[pivot],
6. i = start+1;
8. for (; i<=end;i++) {
9. if (arr[i]<temp) {
10. var s = arr.splice (i,1) [0];
11. Arr.splice (start,0,s);
12. pivot++;
13. }
14. }
15. Q (start,pivot-1);
16. Q (pivot+1,end);
17. }
18. Q (0,arr.length);
19. return arr;
20. }
21. var arrs = [9,45,45,90,3,77,4,90];
22. var c = quicksort (ARRS);
23. Console.log (c);

if (start>=end) {return;} in line 3rd, I consider this way of quitting recursion.

When there are two items left in the Subarray, two scenarios are analyzed:

(1) When the first sub-array (passed to the parameter start) is smaller than the second item (passed to the parameter end)

In the function q the first adjustment is made, the last variable start points to the first item, the variable pivot points to the first item, and then:

Q (start,pivot-1);//At this time Start==pivot, so start>pivot-1, through if (start>=end) {return;} Exit recursion

Q (pivot+1,end);//At this time pivot+1==end, the same as exit recursion

(2) When the first item is larger than the second

In function q, make the adjustment again, the last variable start points to the first item, the variable pivot points to the second item, and then:

Q (start,pivot-1);//start==pivot-1 at this time, exit recursion

Q (pivot+1,end);//At this time pivot+1>end; also exits recursion

Fast Sort algorithm JavaScript implementation