OBI Practice Questions - Olimpíada Brasileira De Informática Exam

Access More Questions

What is the time complexity of building a Binary Heap (Build-Heap) from an arbitrary unsorted array of N elements using Floyd's bottom-up heapify algorithm, compared to inserting elements one by one into an initially empty heap?

O(N) for bottom-up Build-Heap, versus O(N log N) for N successive insertions O(N log N) for bottom-up Build-Heap, versus O(N) for N successive insertions O(N log N) for both methods, because every element requires O(log N) comparisons O(N^2) for bottom-up Build-Heap, versus O(N log N) for successive insertions

Correct Answer:

O(N) for bottom-up Build-Heap, versus O(N log N) for N successive insertions

Access more questions from this quiz

Continue to OBI Practice Questions - Olimpíada Brasileira de Informática Exam for more practice questions and the full quiz experience.

Access More Questions