Select the sorting algorithms that are stable.
(A) Quick Sort
(B) Bubble Sort
(C) Insertion Sort
(D) Merge Sort
(E) Shell Sort
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (B), (C) and (D) Only
Explanation
Bubble, insertion and merge sort keep equal keys in their original order. Standard quick sort and shell sort are not stable.More Data Structures and Algorithms questions
- ______ is a self-balancing binary search tree where the path from the root to the farthest leaf is no more than twice as long as the path f…
- Match List I with List IIList I List II (A) Dijkstra's Algorithm (I) Finds the shortest path between all pairs of vertices in a graph with…
- Arrange the following steps in the correct order to solve the Knapsack problem using Dynamic Programming. (A) Define the base case when the…
- Match List I (Recurrence Relation) with List II (Complexity)List I List II (A) T(n) = 2T(n/2) + n (I) T(n) = Θ(n log n) {exact solution} (B…
- Which of the following is NOT a palindromic subsequence of the string "ababcdabba"?
- Which of the following is TRUE?