M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following sorting algorithms is the fastest?

  • (A) merge sort
  • (B) quick sort
  • (C) insertion sort
  • (D) shell sort
Share
Explanation by: Mr. Dubey
quick sort is the fastest known sorting algorithm because of its highly optimized inner loop.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The ________ algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets.

Q. Which of the following is a combined linear and constant envelope technique?

Q. Relational schemas and other metadata about relations are stored in a structure called the

Q. An operational system is _____________.

Q. In S-R flip-flop, if Q = 0 the output is said to be

Q. synchronization overhead is required in TDMA due to transmission.

Q. How many conditions have to be met if an NP- complete problem is polynomially reducible?

Q. is interface in which a person interact with digital information throgh the physical environment.

Q. EBCDIC can code up to how many different characters?

Q. What are the different ways distributed may suffer?

Question analytics