Video

But in case, if we want to retrive all the possible pairs, be that pair of 2 or 3, in that case we have to loop each element with every other element I believe.

Since you are calling a linear function (len()) every time. Doesn't that worsen the overall runtime? I tried the same program on my computer with a list of length 100 million. It took around 1 minute when it should have been alot faster for a n log n function

why do you need a visited array in dijkstra?

Awesome man ! like it

"The shortcut I was searching for, I finally got it. Thank you very much."

Here in 2024 👏❤.

9:46 You forgot to say "- 1" after "right will be the length of the array" (since left starts at 0 and not 1). The explanation is great! I forgot about how this works after several years of no practice, but now I remembered everything!

brilliant!!!

My output is coming = [0,0,0,0,0,0,0,0,0,0,0] why is it so?

Finally found this method...i was looking for this one❤

This is indeed a great explanation.Thanks a ton.

ich küss dein herz

You are not returning anything from the function then how you able to get the sorted list in the console 😂😂

Very well explained. My algorithms class was terrible lol.

Thank you sir! ❤

instead of swapping, why don't we just add the current_minimum value at the end of an array? I mean, wouldn't it be faster? [] - [3, 1, 4, 2] [1] - [3, 4, 2] [1, 2] - [3, 4] [1, 2, 3] - [4] [1, 2, 3, 4] - []

Is O(n) the time complexity of this code or is it O(nlogn)?

So simply and beautifully explained. I went through several videos on this topic and you are on the podium.

Y we won't connect any node to E

May you pillow be always cold on both sides

Eloquent, beautiful. Thanks

Subscribed❤

3:42 diagram youre using is technically incorrcet ∆ABD has one side AB=2 and side BD=5 third side AD=8 And thats incorrect because un triangles sum of two shorter sides is always greater than third side Same is incorrect for ∆EFC Also the ∆BED and ∆FED do not follow Pythagoras throrem otherwise the diagram is incorrect Because In ∆BED BE=6 DV=5 according to Pythagoras theorem 6²+5²=DE² =36+25=3²(value DE) Now mathematically 61≠9 therefore the diagram IS incorrect Same applies to the other triangle as well 1²+2²≠3² 1+4≠9 5≠9 Therefore youre wrong in the diagram a lot

great video thanks man

Tomorrow is my Design amd Analysis of Algorithms exam, your videos on quick, merge sort and now this have been really helpful. Thanks man.

yeah, imma kiss u bro

thankyou

Thanks. It is great tutorial and easy to understand

00:05 Dijkstra's algorithm calculates the shortest path from a fixed node to every other node in a weighted graph. 01:04 Assigning tentative distance values to nodes 02:05 Update table with new shorter distances 03:08 Updating the shortest distances for unvisited neighbors 04:17 Updating shortest distance and previous nodes 05:20 Updating shortest distances using Dijkstra's algorithm 06:30 Dijkstra's algorithm finds the shortest distance from a starting node to all other nodes in a graph. 07:32 Dijkstra's algorithm helps to reconstruct the shortest path.

Be continue bro.

I like the example graph you make. With doesn't make it find the best in the first search, it makes me understand better

perfect video. 10/10

Thank you

Help Please...N What about the blank space in Node A..? WHAT should we write on previous node of A😢..!!?

Wow, I just installed the algorithm to the brain in 8 minutes🧠. Thank you, Sir.

100/100 explaining , thank you so much

i've been searching for hours for a video that could explain exactly what happens when there is only 2 elements, and i finally got it! thanks a lot

Why do I keep thinking 3 years ago was 2017 and not 2021? 💀

ˢⁱʳ ʷᵉ ᵐᵘˢᵗ ᵗʳᵃᵛᵉˡ ᶠʳᵒᵐ ᵈ ᵗᵒ ᶠ ʳʸᵗ ᶜᵃᵘˢᵉ 7+2=9 ᵇᵘᵗ ᶠʳᵒᵐ ᵈ ᵗᵒ ᵉ ⁱˢ ˡⁱᵏᵉ 7+3=10

Thanks bro, really great visual. You saved me a lot of time

Thanks for the explaining the Dijkstra algorithm so well. 😊😊

Using a laser pointer or at least the mouse while you talk will go a long way to connect what you are saying with what people can see. Otherwise it is a good lesson.

yes this video helped. thank you for doing this!

I trust this guy beacuse of his german accent

WTF distance between D and E is 10 not 8🤚

thnks for good explaination

This is the best dijkstras explanation on youtube

I found your code simple but but i dont think it is the correct example of insertion sort. bcz in insertion sort, we pick one element and put it to its correct location, but you kept swapping the element with the previous element until the previous element is not smaller than our main element. So it is technically an example of bubble sort that is executed in the reverse direction. You won't get what im trying to say just by reading my sentence. Therefore look at this example of insertion sort : l1 = [5,1,3,4,2] n = len(l1) for i in range(n): k = l1[i] j = i-1 while k<l1[j] and j>=0 : l1[j+1] = l1[j] j -= 1 else: l1[j+1] = k print('Sorted list: ', l1)

Nice but i did all there in the year 1992 Borland Turbo Pascal

it helped me understanding the algorithm. thank u very much