McqMate

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. |

Answer» D. heap sort is not a comparison based sorting algorithm. |

1.6k

0

Do you find this helpful?

1

View all MCQs in

High Performance Computing (HPC)No comments yet

- Which of the following statements is NOT TRUE for Internal Sorting algorithms
- The fundamental operation of comparison-based sorting is ________.
- ______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.
- Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
- ______ can be comparison-based or noncomparison-based.
- Following issue(s) is/are the true about sorting techniques with parallel computing.
- Which of the following is not a stable sorting algorithm in its typical implementation.
- Which of the following is not an application of topological sorting?
- Which of following is NOT A WAY of mapping the input wires of the bitonic sorting network to a MESH of processes
- In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options