Explaining same and giving time complexity different
Prims algo graph
there some other heap as well.
like binomial heap,fibonnaicci heap , binary heap.
so depending upon these heap their time complexity might vary
Yess i saw some fibonaaci heap there…
When to use which heap??
use priority queue stl ( u can read its internal implentation for more details).
this is just to pass semester exam.
But they are using it for better time complexity other then semester exam it has importance i think…
that is why i m telling u to refer internal implementaion of priority queue.
it is using one of those listed heap. (i dont remeber u can google it)
Ohk thanks… … …
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.