1
Q
Max-heapify
A
Inputs: array A and index i into the array
2
Q
Fastest algorithmic complexity class to get the ith smallest element, worst case
A
O(n)
Programming
flashcards
Decks in class (12)
# Cards
Max-heapify
Inputs: array A and index i into the array
Fastest algorithmic complexity class to get the ith smallest element, worst case
O(n)
Key Links
Subjects
Company
Find Us
