M

Mr. Dubey • 52.30K Points
Coach 

Q. What is the worst case time complexity of a quick sort algorithm?

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

Explanation: 
 the worst case performance of a quick sort algorithm is mathematically found to be o(n2).

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. How many memory locations are addressed using 18 address bits?

Q. ] for row in (0, 1, 2)]

Q. When a copy constructor may be called?

Q. In UNIX, the set of masked signals can be set or cleared using the function.

Q. A 32 bit microprocessor has the word length equal to

Q. Which of the following is best known service model?

Q. Which of the following is related to fifth generation computers?

Q. enables open application layer for constrained nodes.

Q. A display controller serves to pass the contents of

Q. Datagram switching is done at which layer of OSI model?