Awesome q2a theme
0 votes
8 views

 

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

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

 

Choose the correct option.

  1. 1,2.
  2. 2,4.
  3. 4.
  4. 2.
in Algorithms by (22 points) | 8 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jun 2020
  1. vps123

    4 Points

  2. ummokkate

    1 Points

  3. Kushagra गुप्ता

    1 Points

  4. faseela45

    1 Points

  5. srestha

    1 Points

7,385 questions
1,744 answers
10,702 comments
90,357 users