Algorithms · Question 17 · Easy
Which of the following sorting algorithms is stable in its standard implementation, meaning equal keys keep their original relative order?
- Quick sort
- Heap sort
- Selection sort
- Merge sort
Answer and explanation
Answer: D. Merge sort
Explanation: Standard merge sort takes from the left half when keys are equal, so it keeps equal keys in their original order. Standard quick sort, heap sort and selection sort can swap equal keys past each other.
Previous: What is the best-case time complexity of linear search on an array of n… · Next: Which algorithm finds single-source shortest paths correctly even when some…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- For the naive recursive Fibonacci function below, how many times is fib called…
- Using the Master theorem, what is the solution of T(n) = 3T(n/2) + n?
- What is the best-case time complexity of linear search on an array of n…
- Which algorithm finds single-source shortest paths correctly even when some…
- What is the worst-case time complexity of merge sort on n elements?
- What is the time complexity of finding the largest element in an unsorted…
- Bubble sort is applied to the array [4, 1, 3, 2] in ascending order. What does…
- Two sorted lists with 6 and 9 elements are merged into one sorted list using…
- An undirected weighted graph has the edges A-B 4, A-C 1, B-C 2, B-D 5, C-D 8…
- What is the solution of the recurrence T(n) = T(n - 1) + n, with T(1) = 1?
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge