McqMate

Q. |
## Which of the following is not a stable sorting algorithm in its typical implementation. |

A. | insertion sort |

B. | merge sort |

C. | quick sort |

D. | bubble sort |

Answer» C. quick sort |

2.7k

1

Do you find this helpful?

10

View all MCQs in

High Performance Computing (HPC)
MD

1 year ago

I want to see the mcq

0

- to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
- Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n) 2. begin 3. for i := n - 1 downto 1 do 4. for j := 1 to i do 5. compare-exchange(aj, aj + 1); 6. end X_SORT
- Which is the fastest sorting algorithm
- Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
- Which of the following is not true about comparison based sorting algorithms?
- Which of the following is not an application of topological sorting?
- Which of the following statements is NOT TRUE for Internal Sorting algorithms
- 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
- In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options