Answer to this please

[garganshul151 (anshul garg)]

Whats the difference between this approach and the previous one,ie,using class heap which is O(logn)…and if we can build the heap using O(logn) then why to use this approach O(nlogn).

[aman212yadav (Aman Yadav)]

hello @garganshul151

@garganshul151

using class heap which is O(logn)…and if we can build the heap using O(logn) then why to use this approach O(nlogn).

no we cannot build complete heap in log(n).

it takes O(n) time to build heap -> proof