Question: What is the worst-case time complexity for building a heap from an array of n elements?

Options:

1. O(n)
2. O(n log n)
3. O(log n)
4. O(1)

Correct Answer: O(n)

Solution:

The worst-case time complexity for building a heap from an array of n elements is O(n) using the heapify process.