Course
Practice
Questions
Rating
Search
/
Premium
Login
Search
/
Course
Practice
Questions
Rating
Premium
Login
/
Search Java Hub
Start typing a topic, article, exercise or interview question.
Loading…
#1
What Stability Means
0
When is a sorting algorithm called stable?
When its running time is always O(n log n)
When elements equal by the sorting criterion keep their original relative order
When it uses no auxiliary memory
When the result contains no equal elements
Exercise review
Mentor
Solution
Mentor
We can discuss the current task or any algorithms theory. I’ll help you understand it and find the next step.
Sign in to use the Mentor
The Mentor uses the current exercise and your conversation history.
Sign in
Sign in to view the solution
The solution and explanation are available after signing in.
Sign in
