sir me hamesha se dijksta algo ki complexity find krne me confuse rehti thi....but aapke explanations se clear ho gaya hai,, ab kabhi nahi bhulungi .......sir abhi tak bahut se teachers ko explain krte dekha hai but aapke jesa explanation kabhi nahi dekha.....great sir....aap bahut shaandar samjhate hain.....
Thank u sir .....I m in 6th sem of my B Tech. Maine 3rd aur 5th ....dono sem mein Dijkstra algorithm padhi thi....iska question bhi kiya tha exam mein .....but aaj tak iski time complexity smjh ni aayi thi ....par aaj gayi....only bcz of you....thanks mere interest ko padhai m aur develop karvane m aur mereko confidence dilane m ki I can also prepare for GATE exam.....Aapko shat shat naman sir🙏🙏.I wish m bhi GATE crack kr paun aur apka aur apne parents ka naam roshan kr paun.
Sir. Airthmetic macro operation in computer organisation 1) .binary substraction 2).Binary increment 3).Binary adder Ka lecture playlist me send kar do plz kyuki aapke sivai kisike lecture me vo sahi nahi sikhate or hum pehle aapke video dekhte aayehe to obviously aap ka lecture samaj aaye ga Thank you
Sir, At 8:48 you said that to decrease (Performing Relaxation) we take logV time. But considering the worst case Senario where a vertex is connected with all the vertices (Eg : Complete Graph). In this example, we would be checking and relaxing V times for a particular vertex (As there exists a direct edge from each edge to all the other edges). This process would be continued for all the V vertices. So we would be checking V*V times the Relaxation process. So won't the Time Complexity overall be O(V*V) ??
You are right. And video me bhi yahi bataya hai. The complexity can even be worse than O(v*v). For a complete graph or a graph "close to" a complete graph, the number of edges are O(v * v) For each edge, we'll decrease key which will take O(log(v)) which makes the complexity: O(v * v * log (v)) And this case is covered in the complexity given as O(Elog(v)) as E = O(v * v). The idea is not to find the worst possible and O(E log (v)) is certainly the worst possible.
because in relaxation procedure we are mainly performing decrease key operation, and rest will take constant amount of work therefore only consider the time of decrease key operation in min heap i.e, O(log n) that is equal to O(log v).
sir first step mein har vertex ko infinity assign kr diya second step mein relax karne ke liye min heap mein se 2 pick kiya agar 1,2,3.. ki jagah a,b,c... vertices ho to kaise decide karenge ki heap mein min element kaun sa hai
We are given a dictionaryD, which is an array ofndistinct strings, sorted in lexicographic order.We are also given a procedureCompare-Strings(x,y), which will compare two stringsxandyin Θ(1) time, and returntrueifxcomes beforey, andfalseifycomes beforexin lexicographicorder. We are also given an arrayC, which containsn-1 of thenstrings inD, butCis not sorted.We would like to develop an algorithm that will find the string that is missing inC.(a) [15 pts] Design a divide-and-conquer algorithm that will find the missing string in Θ(n) time.You can assume that we can utilize thePartitionalgorithm that is used byQuickSort, bymodifying it to compare strings instead of comparing numbers (you do not need to show howto do the modification). Write the pseudo-code of your algorithm and explain how it works.(b) [10 pts] Show that the runtime of your algorithm is Θ(n)
Sir, in this also we're creating kind of spanning tree and in a spanning tree no. of edge should be v-1 so in calculating time complexity VlogV and ElogV me ElogV wala kaise jada hua sir ??
![Seungmin "그렇게, 천천히, 우리(As we are)" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/kAzmhLHePqU/mqdefault.jpg)
I don't know why don't these teachers are getting popular in entire India .... He deserves better ❤❤ Thanks a lot bhaiya ❤❤
because their college teachers are even better..unlike Pakistan
sir me hamesha se dijksta algo ki complexity find krne me confuse rehti thi....but aapke explanations se clear ho gaya hai,, ab kabhi nahi bhulungi .......sir abhi tak bahut se teachers ko explain krte dekha hai but aapke jesa explanation kabhi nahi dekha.....great sir....aap bahut shaandar samjhate hain.....
Sir, thank you very very very much 🙏
Your videos are one of the most useful resources available to us. You are a blessing to us
Thank u sir .....I m in 6th sem of my B Tech. Maine 3rd aur 5th ....dono sem mein Dijkstra algorithm padhi thi....iska question bhi kiya tha exam mein .....but aaj tak iski time complexity smjh ni aayi thi ....par aaj gayi....only bcz of you....thanks mere interest ko padhai m aur develop karvane m aur mereko confidence dilane m ki I can also prepare for GATE exam.....Aapko shat shat naman sir🙏🙏.I wish m bhi GATE crack kr paun aur apka aur apne parents ka naam roshan kr paun.
Thanks a lot sir sir for replying to my msg🙏🙏👍
Thanks for explaining everything related to this Dijstra Algo
Thanks a lot sir for sharing such a wonderful , awesome , outstanding n understandable videos
Overwhelming lectures.Don't know how to pay you back, want to give more likes but there is option for only one.Thank you ❤❤❤
Legends watching on Same day exam.
1 hour before the exam
2 hour before exam
1 hour 24 mins before exam😂
1 hour before
Hand, s up man
Mashallah your way of teaching ❤️✨💫
allah oo akbar
Mene bhi krdiya subscribe kyunki subscriber bhot jruri h 👌🏻👌🏻👌🏻
Pakistani Students are taking your notes they have more trust on you rather then their university professors ...Kudos Sir 👏
Legends studying last night before exams 🔥
Thank You sir
😐🥲
Tomorrow is exam.. Now watching this
Yes bro 😂
Tomorrow is exam,and I listening the name of Dijksta 1st time in sir's video 😢😂😂
Amazing video. I can understand very easily 😊
God gifted teacher for us💌💌
Yes i share ur channel with my all fellows
Bhai maza aa gya yr literally, not expected this much clarity.
thank you so much sir... :)
Welcome
hello
Heyy dear
Welcome beta love you
Surbhi yrr mujhe explain krde tujhe smjh aa gya to 😊
Amazing explanation ji
You are such a gem ! Love from Bangladesh Sir
Apki videos sa mera pichhle sare sem clear hogya h tw❤
💯💯💯 dimag mein ghus gya
Thankyou very much sir.. i always used to cram the complexity of this algorithm. Now i understand it
i guess Im pretty randomly asking but does anyone know a good website to stream new movies online ?
@Malcolm Mathias I watch on Flixzone. Just search on google for it =)
@Abdiel Amir Yup, I've been using flixzone for months myself =)
@Abdiel Amir definitely, I have been using flixzone for years myself :)
@Abdiel Amir thank you, I went there and it seems like a nice service :) Appreciate it!
great explanationn 👏👏
really so great sir thank you very much 😊😊😊😊
thank you 💯💯
Stunning
very nice explanation ❤❤
बहुत-बहुत धन्यवाद सर
Very nice explanation 🔥🔥🔥🔥
Thankyou sir :) ❤
Thanks sir 👍
Love from Pakistan ❤❤ your great sir really great ❤
Thank you sir
thank you sir ❤❤❤
Thanks sir . Your video very help in my study . Your video very awsm .
Sir. Airthmetic macro operation in computer organisation
1) .binary substraction
2).Binary increment
3).Binary adder
Ka lecture playlist me send kar do plz kyuki aapke sivai kisike lecture me vo sahi nahi sikhate or hum pehle aapke video dekhte aayehe to obviously aap ka lecture samaj aaye ga
Thank you
Thank you sir
congratulation sir for 1k subscriber🥳🥳
Srr kya samjhate hai aap ,aap ko mere university m hona chahiye😃
u r an amazing person with amazing knowledge
Correct Pronunciation is Dike - Struh
Superb sir ❤🎉
Thanks sir
Thnkuu sir 😍😍
who else is watching a day bfr exam?
😂me
Me
Watching a few hours before exam
O behen ji itna sachayi na hi bolna chahiye 😅😅😅😂😂😂😂😂😂
Me 😑
great teacher
thank you, it was really helpfull.
Great job sir
Nice
Thank you sir.. Take care of your health.. :)
Nice ❤️❤️❤️💜💜💜💜💜
Love from Pakistan 😍
Correction - Dude there are more vertices than edges at last on the other way around.
superb sir .. :)
Thanku so much sir..great explanation ❤️
Which sem?
amazing lecture.
thanks for copertating
You're the best 😍
Thank you so much sir
Thank you sir
Sir, do you have an English version of your explanation T_T really need that
Nice sir
How would the value of u iterate through the graph? Since, u = Extract_min[Q] should return 1 again and again right (it's the lowest distance) ?
Sir Love from Pakistan
Sir, At 8:48 you said that to decrease (Performing Relaxation) we take logV time.
But considering the worst case Senario where a vertex is connected with all the vertices (Eg : Complete Graph). In this example, we would be checking and relaxing V times for a particular vertex (As there exists a direct edge from each edge to all the other edges). This process would be continued for all the V vertices.
So we would be checking V*V times the Relaxation process. So won't the Time Complexity overall be O(V*V) ??
bro aapko bhi pata hai time complexity v2 hogi hame bhi pata hai sir ko bhi pata hai to faltu ka doubt leke wannabe good student mat baniye......
@@siddhantjha6649 savage reply bro 😂.
Aise doubt RnD sector mein acche lgte hain, placements and college exams ke time nhi
You are right.
And video me bhi yahi bataya hai.
The complexity can even be worse than O(v*v).
For a complete graph or a graph "close to" a complete graph, the number of edges are O(v * v)
For each edge, we'll decrease key which will take O(log(v))
which makes the complexity: O(v * v * log (v))
And this case is covered in the complexity given as O(Elog(v)) as E = O(v * v).
The idea is not to find the worst possible and O(E log (v)) is certainly the worst possible.
This is the first time I'm watching the 2nd day before the exam 😅😅😅
Thnx sir 😊
Sir can you please explain why relaxation time for each vertex is log v?
because in relaxation procedure we are mainly performing decrease key operation, and rest will take constant amount of work therefore only consider the time of decrease key operation in min heap i.e, O(log n) that is equal to O(log v).
I am first
sir
first step mein har vertex ko infinity assign kr diya
second step mein relax karne ke liye min heap mein se 2 pick kiya agar 1,2,3.. ki jagah a,b,c... vertices ho to kaise decide karenge ki heap mein min element kaun sa hai
best..
We are given a dictionaryD, which is an array ofndistinct strings, sorted in lexicographic order.We are also given a procedureCompare-Strings(x,y), which will compare two stringsxandyin Θ(1) time, and returntrueifxcomes beforey, andfalseifycomes beforexin lexicographicorder. We are also given an arrayC, which containsn-1 of thenstrings inD, butCis not sorted.We would like to develop an algorithm that will find the string that is missing inC.(a) [15 pts] Design a divide-and-conquer algorithm that will find the missing string in Θ(n) time.You can assume that we can utilize thePartitionalgorithm that is used byQuickSort, bymodifying it to compare strings instead of comparing numbers (you do not need to show howto do the modification). Write the pseudo-code of your algorithm and explain how it works.(b) [10 pts] Show that the runtime of your algorithm is Θ(n)
you are too good
7:07
Add heap to q this is wrong
We will create heap in starting only
Sir kindly upload the lecture of N-Queen with algorithm please please sir it's request
its not algorithm but a leetcode problem based on backtracking bruh
Where is UET students
Shouldn't it be O(V + E log v) ??
yes
❤❤
But why extractMin() is logarithm time complexity?
VlogV kyu nahi aya ... edges to V-1 ke barabar hote hai so apparently vertices > edges
I doubt think it should be log V. It should be log E, b'coz we can insert same vertex multiple times.
Can you please include videos on bf and df and also b+ trees🙏🙏
ye sab kya h
How to subscribe from multiple devices. Is it multiple accounts or multiple devices?
Nice but not enough
actually writing on te opposite side of where you are standing might be better because we cant see what is written since it is being coverd by you
does this method work for complex problems...my teacher told it does not work for complex problems...
I'm watching before 30 min on exam
Sir please ek baar o(v*v) ek baar bta do sirf apka hi samjh aata h
what does relax mean
😅 relax means after enjoying your relax
Sir, in this also we're creating kind of spanning tree and in a spanning tree no. of edge should be v-1 so in calculating time complexity VlogV and ElogV me ElogV wala kaise jada hua sir ??
same question
❤️❤️
Dsssb mock test k kb tk proper site working
sir esa kuch hai jo aapko nahi aata
Sir adobe shop ka course krna kesa rahe ga iski market kitni dimand kya mujhe is ko karne se work mil apyega
Ultra legend watching 20 days before exam
Legends watching before 30 min of exam😊
Classic ovrview
Legends are watching one day before exam 😂
Aman Dhattarwal OP.
⭐⭐⭐⭐⭐