Implement Quick Sort
M
Software Engineer with 5+ years of experience designing and building clinical-grade systems, including Electronic Medical Records (EMR), medical imaging tools, and scalable backend infrastructures.
I specialize in developing end-to-end healthcare solutions using Python and Django REST Framework, with a strong focus on clinical workflow automation, multilingual systems, and high-performance data handling. My work includes building modular EMR platforms, prescription engines, and hybrid search systems for accurate medical data retrieval.
I have also worked on medical imaging applications, integrating Python-based tools with analysis modules to support diagnostic workflows and image-based decision-making.
Quick sort is an efficient, recursive, divide-and-conquer approach to sorting an array. In this method, a pivot value is chosen in the general array, the array is partitioned into two subarrays of values less than and greater than the pivot. We combine the result of recursively calling the quick sort algo on both subarrays.
Quick sort’s worst case is O(n2) but that can be avoided if we pick a random pivot point, so that way it’s big O is O(nlogn).
Its space complexity is O(logn).
function quickSort(array) {
let n = array.length;
if(n === 0){
return [];
}else{
let pivot = array[n -1];
let int_above = [];
let int_below = [];
let int_equal = [];
for(let i of array){
if(i < pivot){
int_below.push(i);
}
else if(i > pivot){
int_above.push(i);
}else{
int_equal.push(i);
}
}
// Only change code below this line
return [...quickSort(int_below), ...int_equal, ...quickSort(int_above)];
// Only change code above this line
}
}
