M

Mr. Dubey • 52.30K Points
Coach 

Q. What is the average running time of a quick sort algorithm?

(A) o(n2)
(B) o(n)
(C) o(n log n)
(D) o(log n)
Correct : Option (C)

Explanation: 
 the best case and average case analysis of a quick sort algorithm are mathematically found to be o(n log n).

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following is the fastest means of memory access for CPU?

Q. What does an IC that initiate or enable the data transfer on bus can be regarded as, in accordance to the I2c protocol specifications?

Q. Which of the following method is used for multiclass classification?

Q. Which of the following is the most refined and restrictive service model?

Q. Chan’s algorithm can be used to compute the lower envelope of a trapezoid.

Q. In a compiler, keywords of a language are recognized during

Q. Which are the dependencies types:

Q. Which of the following is the wave number of near infrared spectrometer?

Q. is around one-half of the maximum seek time.

Q. A product term containing all K variables of the function in either complemented or uncomplemented form is called a