📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Algorithms
/
Sorting Fundamentals
Sorting Fundamentals
Question 1 of 6
What does it mean for a sorting algorithm to be stable?
A
Equal elements keep their original relative order after sorting
B
It uses O(1) extra space
C
It terminates on all inputs without infinite loops
D
It always runs in O(n log n) time
← Back to categories