Skip to content
Ravnary
A Knowledge Platform
Categories
Learn
Cheatsheets
Paths
Favourites
Review
Community
Colour theme
Light
Dark
System
Learn
Algorithms
Efficient Sorting
Choosing a Sorting Algorithm
Quiz
Q 01
/ 04
Intermediate
Question 1 of 4. 0 correct, 0 incorrect.
A device must sort 50 million records with almost no spare memory, and every input must finish in O(n log n) time. Which algorithm fits?
Merge sort
Heapsort
Quicksort
Check answer
Home
Learn
Paths
Saved
Community