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

Mr. Dubey • 52.30K Points
Coach

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

(A) one

(B) two

(D) four

Correct : Option (B)

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.

Discusssion

Be the first to start discuss.

Q. The primary advantage of this method is

Q. Which of the following syslog.config entries would cause kernel error message to be sent to the system console ?

Q. Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only

Q. Which of these statements is truly acceptable?

Q. Lost update problem is

Q. Which of the following is an primary goal of HTC paradigm___________?

Q. A model developed by Hammer and Mc Leod in 1981.

Q. What is the function of the controller in active vibration isolation systems?

Q. Which command is used to display the characteristics of a process?

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

Discusssion

Related MCQs