MADEASY TESTSERIES DS

Question

IN THE VIA HEAP LIST WHY IT IS O(LOGN) FOR SEARCHING??

Comments

Sorry, but all these days I have studied and told by the faculties that heap is an efficient way to implement a priority queue. Even it is mentioned in wiki. This answer is conflicting with my concepts. How a sorted array is better for a priority queue?

---

Insertion, Deletion and Searching respectively,

SORTED ARRAY :-

 O(n),O(1) and O(log n)

Heaps :-

O(log n), O(log n) and O(n)

clearly we can observe in one operation, O(1) is better choice than O(log n).

---

Got it, Thanks