How many sub arrays does the quick sort algorithm divide the entire array into?
|Answer» B. two|
|Explanation: the entire array is divided into two partitions, 1st sub array containing elements less than the pivot element and 2nd sub array containing elements greater than the pivot element.|
Login to Continue
It will take less than 2 minutes