Top MCQs on CountingSort Algorithm with Answers (original) (raw)

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

• The minimum possible time complexity of a comparison-based sorting algorithm is O(n(log(n)) for a random input array
• Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
• Counting Sort is not a comparison based sorting algorithm
• Heap Sort is not a comparison based sorting algorithm.

Which sorting algorithms is most efficient to sort string consisting of ASCII characters?

Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?

• Not possible to sort in linear time

There are 3 questions to complete.

Take a part in the ongoing discussion