Easy Remember Sorting & Searching Multiple Choice
Which sorting algorithm is stable and guarantees O(n log n) worst case?
Remember — Tests recall of fundamental facts and definitions.
Answer Options
A Quicksort
B Heapsort
C Mergesort
D Counting sort
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 31+ more Sorting & Searching questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Sorting & Searching topic (Algorithms).
More Sorting & Searching Questions
What is the time complexity of binary search on a sorted array of n elements?
EasyWhat is the space complexity of mergesort?
EasyWhy does quicksort degrade to O(n²) on already-sorted input with last-element pivot?
Medium-EasyImplement binary search to find the leftmost occurrence of a target.
Medium-EasyWhat is the time complexity of the 'binary search on answer' approach for Koko Eating Bananas (LC 875)?
Medium-Easy