0
What is the worst-case time complexity of building a heap from an unsorted array of n elements using the bottom-up heapify approach?
- AO(n log n)
- BO(n²)
- CO(n)
- DO(log n)
Correct answer: C
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!