Q.

How many sub arrays does the quick sort algorithm divide the entire array into?

A. one
B. two
C. three
D. four
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.
995
0
Do you find this helpful?
1

Discussion

No comments yet