In Heap Sort algorithm the maximum levels an element can move-05707
In Heap Sort algorithm, the maximum levels an element can move upward is __________
This multiple choice question (MCQ) is related to the book/course
vu cs502 Fundamentals of Algorithms.
It can also be found in
vu cs502 Mid Term - Quiz No.3.
In Heap Sort algorithm, the maximum levels an element can move upward is __________
Order (log n)
Theta (log n)
Omega (log n)
O (1) i.e. Constant time
