>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which sorting algorithm repeatedly removes an extreme element from a heap representation? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Medium
Which sorting algorithm repeatedly removes an extreme element from a heap representation?
Comparison sorting
Sorting
Choose your answer
A
Merge sort
B
Bubble sort
C
Heapsort
D
Insertion sort
Check answer
More in Algorithms →