M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following is not true about comparison based sorting algorithms?

  • (A) the minimum possible time complexity of a comparison based sorting algorithm is o(nlogn) for a random input array
  • (B) any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
  • (C) counting sort is not a comparison based sorting algortihm
  • (D) heap sort is not a comparison based sorting algorithm.
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What is the return value of trunc()?

Q. ______________ is a means of storing & transmitting information in a specific format so that only those for whom it is planned can understand or p

Q. Auto Form allows you to

Q. Software consists of

Q. OR provides solution only if the elements are

Q. Let A and B is the input of a subtractor then the borrow will be

Q. ------------- are the glue that holds the methods and tools together and they enable rational and timely development of computer software.

Q. 7 If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. T

Q. A 16 bit address bus can generate addresses:

Q. Regarding bias and variance, which of the following statements are true? (Here ‘high’ and ‘low’ are relative to the ideal mode

Question analytics