4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming

preview_player
Показать описание
Matrix Chain Multiplication Program and Explanation

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming
Рекомендации по теме
Комментарии
Автор

One of the best teacher. Thank you Sir. God bless you and your family always.

shardaapril
Автор

Compared to others making similar videos, he's quite elaborate even though slow. For beginners, it is perfect.

minhazmuktadir
Автор

Thank you Sir for taking the hardship for making all of these well-explained Video Lectures. You deserve a lot of Respect for your hard work. Thank you!!

mdkamrankhan
Автор

One can understand completely matrix chain multiplication with these two videos Outstanding... awesome.

nikhilmahato
Автор

We had this same exact example in class and I understand where the 88 and 104 came from now. Thank you!

MrPollitogatito
Автор

best teacher i have ever found on earth, love you sir always❤❤❤❤❤❤❤❤❤❤

Hussainsaddam-cv
Автор

Sir, your explanation is awesome. most simplest, yet highly effective. hats off to you Sir!!!

sandeepmandrawadkar
Автор

This channel deserves the most subscribers because these video lectures are among the best channels for CS

PhantomAnonymous-iepi
Автор

jump to 16:49 those who are here just for Print Algo.
Abdul Bari sir you are one of the most awesome teachers I have learned from, thanks for publishing excellent quality videos.

jaatharsh
Автор

I think it would be better to set "m[i][j]" to -1 before the 3rd loop and then check if(q < m[i][j] || m[i][j] == -1)
Theoretically it would be best to set "m[i][j]" to infinite but practically -1 is easier to use.

Toopa
Автор

super easy program!! this topiic takes my long time to understand and u make it so easy to understand. thanks alot sir!!

_akashsharma
Автор

as Simple as it can get. Thanks for this explanation!!

abhishekkumargupta
Автор

Thank you for the video sir! But can you please put the code in the description?

annafebland
Автор

Amazing videos and explaination! Thank you, sir!

Quelledine
Автор

very good explanation. but one minor issue
k should start from i instead 1.
for(k = i; k <= j - 1; k++){
}

sadekujjamansaju
Автор

sir you are awesome ...far better than tushar roy...you are my online guru and goto person for algorithms...very much thankful

RaviKumar-vkib
Автор

Nice explanation Sir!! But the code is not present in the description box can you pls add it?

aishwaryaverma
Автор

pretty easy compared to the code of multistage graph, thank you for explaining it so well

krutikabarad
Автор

sir the code u have has bug because of 2 way recursion while printing u gave cout<<s[l][h+1] which is wrong rather it should be cout<<l

harishch
Автор

in the program there should be k = I thanks sir u r amazing <3

bhavyanayyer