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
Correct answer is option 'D'. Can you explain this answer?
Related Test: Sorting MCQ - 1

Computer Science Engineering (CSE) Question

Can you answer this question?

People are searching for an answer to this question.
This discussion on 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 arrayb)Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are comparedc)Counting Sort is not a comparison based sorting algortihmd)Heap Sort is not a comparison based sorting algorithmCorrect answer is option 'D'. Can you explain this answer? is done on EduRev Study Group by Computer Science Engineering (CSE) Students. The Questions and Answers of 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 arrayb)Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are comparedc)Counting Sort is not a comparison based sorting algortihmd)Heap Sort is not a comparison based sorting algorithmCorrect answer is option 'D'. Can you explain this answer? are solved by group of students and teacher of Computer Science Engineering (CSE), which is also the largest student community of Computer Science Engineering (CSE). If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for Computer Science Engineering (CSE) on EduRev and even discuss your questions like 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 arrayb)Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are comparedc)Counting Sort is not a comparison based sorting algortihmd)Heap Sort is not a comparison based sorting algorithmCorrect answer is option 'D'. Can you explain this answer? over here on EduRev! Apart from being the largest Computer Science Engineering (CSE) community, EduRev has the largest solved Question bank for Computer Science Engineering (CSE).