Data Structures and Algorithms - Sorting and Searching

41. The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)

  • Option : A
  • Explanation : The maximum number of comparison is number of items ´ radix ´ number of digits i.e., 7´10´4 = 280.
Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


42. Which of the following algorithms exhibits the unnatural behavior that, the minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and a maximum number of comparisons are needed if they are already in sorted order?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


43. Which of the following sorting algorithm has the worst time complexity of nlog(n)?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


44. Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.