Heap on Data Structure and Algorithms related Questions and Answers


Question :   An array consist of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
1. O(n*n*logn)
2. O(n*logn)
3. O(n*n)
4. O(n *logn *logn)
Answer :   2 - O(n*logn)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter