Question

The time complexity of building a heap from an unsorted array of n elements is:

A O(n log n)
B O(n²)
C O(n)
D O(log n)
E O(n √n)
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)