QuickSort_2
12345678910111213141516171819202122232425262728293031323334
const partition = function(arr, l, r){ // [5,7,4,3,6])
const povit = arr[r];
let p = l-1;
for(let i = l; i < r; i++){
if(arr[i] < povit){
p++;
let temp = arr[i];
arr[i] = arr[p];
arr[p] = temp;
// console.log(arr);
}
}
p++;
arr[r] = arr[p];
arr[p] = povit;
return p;
}
const quickSort = function(arr, l, r) {
if(l >= r) return;
let p = partition(arr,l,r);
console.log(p);
quickSort(arr,l,p-1);
quickSort(arr,p+1,r);
}
const sort = function (arr) {
quickSort(arr,0,arr.length-1);
return arr;
}
console.log(sort([5,7,4,3,6]));
JavaScript
INFO