38.1 Time Complexity of Prim's Algorithm (Part 1) | Detailed Analysis with Exapmple | Database

[@bulioh]

clearest explanation I've seen on this, beautifully done

[@ayushnigam9424]

I wasn't getting this topic but after watching this I got it.
Thankyou Sir.

[@SureGATESuccess]

Thanks, Glad to hear that.

[@joelv9810]

can you explain why for the first decrease key it was 3 + 3logv instead of just 3logv

[@amanmaddhesia120]

God bless you sir,
I got each and every point in a crystal clear way.
Thank you so much sir.❤❤

[@SureGATESuccess]

All the best

[@berkant8074]

incredible sir, thanks from turkey.

[@SureGATESuccess]

Thanks for the kind words ❤️

[@AndrewNehme-x4g]

thank you sir for your informational explanation!

[@anandshivam1540]

How can I find the time complexity using using Adjacentcy matrix, Array ?

[@SureGATESuccess]

The time taken can be computed using:
Array Initialization + Deletion + Find Adjacency + Decrease key operation.
It's really difficult to explain in a detailed manner specially here in comments.
Check out the next video for detailed analysis

[@gokulnath610]

THanks sir, awesome analysis!

[@SureGATESuccess]

I'm Glad it was helpful 😊

[@safionweb]

Great video, subscribed!

[@SureGATESuccess]

I am glad you find it useful, there is always more to learn check out the other videos as well.
Stay blessed 💗

[@akbaransari4358]

Good sir, Thank you for detail explanation.

[@SureGATESuccess]

Glad it was helpful!

[@AjeetKumar-uf9wb]

Subscribed and thanks for making this video

[@SureGATESuccess]

I am glad you find it useful.
Stay tuned as many more such videos will be coming up.

[@lovestaco]

nice one sir keep up

[@SureGATESuccess]

Thanks.
I was quite busy in my primary work, planning to resume it soon.

[@vikasverma7349]

please explain for complete graph

[@SureGATESuccess]

The time complexity discussed is for the complete graph only. Please watch both part 1 and part 2. Hopefully all your doubts will be cleared.
Feel free to ask if you still have any doubts.
Stay blessed ❣️

[@sunilpatidar8609]

new subscriber

[@SureGATESuccess]

Thanks for subbing!

[@Joac0ck]

So the avarage case complexity will be the same to the worst case complexity?
P.S : Nice explanation btw

[@mdmuquimakhter5145]

Time complexity will be O(ElogV)

[@SureGATESuccess]

I discussed time complexity in detail and it's right, it can vary according to the cases.

[@AppleFreak1976]

this guy rivals abdul

[@umarmomin7777]

I am damn sure u was a std of reddy sir
but nice explanation

[@SureGATESuccess]

Yes, you are right!

[@Krushna-gaikwad1]

I think This person is reddy sir student.

[@SureGATESuccess]

Yes you are right. 😁

[@Krushna-gaikwad1]

Yesterday sir explained all this story on unacedemy yo our batch.

[@SureGATESuccess]

I can completely understand, he is a legend for me as well