Test series

Question

Plzzz explain...

Comments

Is it C Option?

---

No...A is given as a answer,

---

Only two option looking best A and C , so chooses C .

Okk but A is answer my reason regarding A is using built heap you can got O(n)

---

Ok...thanku...bro!

---

answer is O(m+n) since m can be , m>>>>n. then time will be O(m) not O(n).

---

Can u explain how it is O(m+n)

---

@Anu

and if m<<n

A) will be ans

and also say m=1

we can O(n+1)=O(n)

---

and @srestha

why are you assuming m<n ?

O(m+n) is best option, it will satisfy either if m<n or n<m , but O(n) is not correct if m>n

---

Sir can you explain reason behind O(m+n)

---

@Chirag,

O(m+n) is a time complexity to apply build heap on m+n elements.

---

Sir can you give link for build heap..

---

see this

---

@nitish

Not necessarily one after another

If this was not mentioned in the question. We would take this as inserting each element individually, and its complexity would have been O(mlogn),? 

---

yes....