M

Mr. Dubey • 52.30K Points
Coach 

Q. The time complexity of quick sort is …………..

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

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. In order to assess how much information is brought by each component, and the correlation among them, a useful tool is the .

Q. The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is

Q. In precedence of set operators the expression is evaluated from:

Q. Languages are proved to be regular or non regular using pumping lemma.

Q. While setting Quality objective, ________ to be considered.

Q. Data scrubbing is _____________.

Q. means to impart understanding of the message.

Q. Array can be considered as set of elements stored in consecutive memory locations but having __________.

Q. What’s the best Access object for an invoice you’ll mail to customers?

Q. Clandestine Scanning is ..............