L-4.11: Dijkstra's Algorithm Analysis | Time Complexity | Pseudocode Explanation

Подписаться 1,9 млн

Просмотров 436 тыс.

50% 1

👉Subscribe to our new channel: / @varunainashots
►Introduction to Dijkstra's Algo: • L-4.10: Dijkstra's Alg...
0:00 - Working of Dijkstra's Algo
6:15 - Time Complexity
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on RU-vid: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com

Опубликовано:

7 июл 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 140

@adarshjhaxiif-1289 Год назад

I don't know why don't these teachers are getting popular in entire India .... He deserves better ❤❤ Thanks a lot bhaiya ❤❤

@usamasana8785 Год назад

because their college teachers are even better..unlike Pakistan

@hinatashoyo7985 3 года назад

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

@bhaskarkumarsingh322 Год назад

Thanks for explaining everything related to this Dijstra Algo

@toshibamansoori8735 3 года назад

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.....

@yogitasharma7344 3 года назад

Thanks a lot sir for sharing such a wonderful , awesome , outstanding n understandable videos

@kushpatel4811 3 года назад

Amazing video. I can understand very easily 😊

@kokilagoel2714 3 года назад

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.

@kokilagoel2714 3 года назад

Thanks a lot sir sir for replying to my msg🙏🙏👍

@minahilfatima3781 2 года назад

Yes i share ur channel with my all fellows

@ayyan6061 Год назад

Stunning

@rishigarnayak681 3 года назад

u r an amazing person with amazing knowledge

@yourhero3254 2 месяца назад

Legends watching on Same day exam.

@B_I_N_G_0 2 месяца назад

1 hour before the exam

@chaudhrysamtech7269 2 месяца назад

2 hour before exam

@haetaswani9111 2 месяца назад

1 hour 24 mins before exam😂

@namaramuk9167 Месяц назад

1 hour before

@Aounbahi Месяц назад

Hand, s up man

@AMAR-pc6ht Год назад

Bhai maza aa gya yr literally, not expected this much clarity.

@ayushnigam9424 3 года назад

amazing lecture.

@psc_youtuber 3 года назад

Gr8 Explanation sir.

@nafisnawalnahiyan5032 2 года назад

You are such a gem ! Love from Bangladesh Sir

@roshinroy5129 2 года назад

Amazing explanation ji

@mpanghal9801 3 года назад

Great job sir

@sahilanand30 2 года назад

Legends studying last night before exams 🔥 Thank You sir

@throttle4you70 2 года назад

😐🥲

@daynadalia Год назад

Tomorrow is exam.. Now watching this

@abdulkarishma8519 6 месяцев назад

Yes bro 😂

@bigfish5768 11 месяцев назад

Overwhelming lectures.Don't know how to pay you back, want to give more likes but there is option for only one.Thank you ❤❤❤

@monushilla6072 2 года назад

बहुत-बहुत धन्यवाद सर

@surbhi_official9206 3 года назад

thank you so much sir... :)

@pro_pranay 3 года назад

Welcome

@harshkumarsingh9621 2 года назад

hello

@aakashmishra9521 Год назад

Heyy dear

@rajivsbhatia333 Год назад

Welcome beta love you

@manishpandit1399 Год назад

Surbhi yrr mujhe explain krde tujhe smjh aa gya to 😊

@Code_land Год назад

Very nice explanation 🔥🔥🔥🔥

@ggadits1855 Год назад

thank you 💯💯

@69upasonabiswas88 3 года назад

Thank you sir.. Take care of your health.. :)

@DIPANSHU_KAPOOR 2 года назад

Mene bhi krdiya subscribe kyunki subscriber bhot jruri h 👌🏻👌🏻👌🏻

@himanshusharma3382 3 года назад

💯💯💯 dimag mein ghus gya

@MANISHSINGH-bf3rs 2 года назад

Thanks sir . Your video very help in my study . Your video very awsm .

@karanjotsingh4814 Год назад

Thank you sir

@msvlogs3744 Год назад

Thankyou sir :) ❤

@kohinoorkhan8529 3 года назад

superb sir .. :)

@ngcreations4770 2 года назад

Thank you sir

@soniyafareedmfareed5775 Год назад

Mashallah your way of teaching ❤️✨💫

@aryanwalia3751 Год назад

allah oo akbar

@mohitkaushik21 Год назад

Thanks sir 👍

@ayushiyadav1 Месяц назад

great explanationn 👏👏

@parakhchaudhary7453 Год назад

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) ?

@jawadhashmi655 6 месяцев назад

Pakistani Students are taking your notes they have more trust on you rather then their university professors ...Kudos Sir 👏

@piyushtripathi5566 2 года назад

Thank you sir ❣️

@sipaliverma9806 3 года назад

Thank you so much sir

@user-yl4is2qr2o 3 года назад

Thnkuu sir 😍😍

@mani_fitness03 8 месяцев назад

Apki videos sa mera pichhle sare sem clear hogya h tw❤

@anchalpandey9074 Год назад

who else is watching a day bfr exam?

@anchalverma04 6 месяцев назад

😂me

@arijitmondal2875 Месяц назад

@SyedZeerak 29 дней назад

Watching a few hours before exam

@shubhammishra-gf7lm 5 месяцев назад

thank you, it was really helpfull.

@parneetkaur-gs4bk Год назад

Thanku so much sir..great explanation ❤️

@WhatAbhiFeels 6 месяцев назад

Which sem?

@Annu_Chaudhary2004 7 месяцев назад

Superb sir ❤🎉

@ch0c0_1 3 года назад

Thankyou very much sir.. i always used to cram the complexity of this algorithm. Now i understand it

@malcolmmathias5881 3 года назад

i guess Im pretty randomly asking but does anyone know a good website to stream new movies online ?

@abdielamir915 3 года назад

@Malcolm Mathias I watch on Flixzone. Just search on google for it =)

@louiekhari3200 3 года назад

@Abdiel Amir Yup, I've been using flixzone for months myself =)

@johnnymayson9150 3 года назад

@Abdiel Amir definitely, I have been using flixzone for years myself :)

@cyrusgrayson7457 3 года назад

@Abdiel Amir thank you, I went there and it seems like a nice service :) Appreciate it!

@zanijutt311 3 года назад

Thnx sir 😊

@IslamicWorld.2505 6 месяцев назад

great teacher

@aimenshah3234 3 года назад

You're the best 😍

@muhammadbilal2627 Год назад

thanks for copertating

@komalbhadarka4329 9 месяцев назад

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

@ritiksolanki3519 5 месяцев назад

very nice explanation ❤❤

@akashbansal5501 3 года назад

❤️❤️

@animeshhazra6061 Год назад

Nice

@DMTech4U 3 года назад

Nice sir

@tryambkeshwartripathi4522 Год назад

Srr kya samjhate hai aap ,aap ko mere university m hona chahiye😃

@MUHAMMADRASHID-rg6dw 6 месяцев назад

Love from Pakistan ❤❤ your great sir really great ❤

@shantipriya370 8 месяцев назад

best..

@shanieee9929 2 года назад

Sir, do you have an English version of your explanation T_T really need that

@cod-e-break246 2 года назад

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

@nisarganag 2 года назад

Correct Pronunciation is Dike - Struh

@SubhamKumar-9009 3 года назад

Nice ❤️❤️❤️💜💜💜💜💜

@manu-prakash-choudhary 2 года назад

you are too good

@badalsaini1236 3 года назад

I am first

@arpannewarpradhan9614 Год назад

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)

@aimenshah3234 3 года назад

Love from Pakistan 😍

@shubhangihatkar1347 3 года назад

⭐⭐⭐⭐⭐

@jaydutta4304 3 года назад

Sir can you please explain why relaxation time for each vertex is log v?

@ayushnigam9424 3 года назад

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).

@mumarmalik8015 2 года назад

Sir Love from Pakistan

@deepikagoyal07 Год назад

How to subscribe from multiple devices. Is it multiple accounts or multiple devices?

@dhruvilsoni4900 3 года назад

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) ??

@siddhantjha6649 3 года назад

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......

@nikhilflautist 3 года назад

@@siddhantjha6649 savage reply bro 😂. Aise doubt RnD sector mein acche lgte hain, placements and college exams ke time nhi

@sankalparora9374 2 года назад

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.

@rebeccap7412 8 месяцев назад

does this method work for complex problems...my teacher told it does not work for complex problems...

@VedantGholap-rf5vr Год назад

VlogV kyu nahi aya ... edges to V-1 ke barabar hote hai so apparently vertices > edges

@kajalsrivastava310 2 года назад

Can you please include videos on bf and df and also b+ trees🙏🙏

@vishwajeetnandyaduraj4804 Год назад

ye sab kya h

@shivanigupta7661 3 года назад

Sir adobe shop ka course krna kesa rahe ga iski market kitni dimand kya mujhe is ko karne se work mil apyega

@akashmalviya1759 Год назад

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 ??