📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Algorithms
/
Divide-and-Conquer Sorts
Divide-and-Conquer Sorts
Question 1 of 6
Why does merge sort guarantee O(n log n) time regardless of input?
A
It detects sorted runs and skips them
B
It uses randomization to avoid worst-case behavior
C
It always splits the array in half (log n levels) and merges each level in O(n), regardless of the input order
D
It uses a hash table to avoid redundant comparisons
← Back to categories