This is the video. I was looking for and thanks for hitting all the details and explaining it so well in such a short time. My teacher talks so slow, low, and does not explain it well like you did. Thanks!
Dont usually bother leaving comments, but i havent done formal maths since i was 16 (8 years ago), and im currently studying for an msc in computer science. This video was absolutely invaluable, and you have an exceptional ability to explain things - thank you very much!
1:57 I'm not sure why when you wrote i - 1 on top of the summation, you said it never reaches i. I didn't understand what you meant by it never reaches "i"? Is it because "i" is not included due to the condition having the "
Hi randerson, Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation
for the inner loop count++ runs in constant time so we use that as c. Then you just follow the formula. and plug in the values. If you see it says c = c(n + 1 - m) so u just plug the values
if u rm how polynomials work u usually take the biggest notation in which is n^2. the n/2 - 3 is thrown away since we don't want to complicate the complexity.
Hi randerson, Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation
This is the video. I was looking for and thanks for hitting all the details and explaining it so well in such a short time. My teacher talks so slow, low, and does not explain it well like you did. Thanks!
Dont usually bother leaving comments, but i havent done formal maths since i was 16 (8 years ago), and im currently studying for an msc in computer science. This video was absolutely invaluable, and you have an exceptional ability to explain things - thank you very much!
You should've stayed off of comments
@@asrithnedurumalli5263??
Excellent explanation, I have an algorithms class midterm today and this helped a lot!!
That's perfect! Thank you for your efforts and your nice calming voice
thanks a lot man. Keep it going. you way in explaining things is simple and straightforward
Thank you finally I understood, you are godsend
wow wow wow i was stuck at this since last 2 lecs but now got ittt , THANK YOUUU !!
This is a good one thanks a lot
WOW, that was rrrrrreally helpful. It opened up for me a whole class of problems. Thanks
thank u so much. finally i found the solution for my problem
Gold !
1:57 I'm not sure why when you wrote i - 1 on top of the summation, you said it never reaches i. I didn't understand what you meant by it never reaches "i"? Is it because "i" is not included due to the condition having the "
That’s basically it
actually for i
Hi randerson,
Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation
Great explanation, good work
Cool!! Thank you, very helpful
very helpful video, thanks
It's easier than my teacher's teaching
Sometimes you just need either more information or a different perspective.
Same here, ty very much !!!!!
This video didn’t make sense. At 3:08 doesn’t n= n-1 not i-1? And doesn’t m=3 not 0?
Really good explanation thanks
how do you know which summation formula to use?
for the inner loop count++ runs in constant time so we use that as c. Then you just follow the formula. and plug in the values. If you see it says c = c(n + 1 - m) so u just plug the values
how to convert (n^2-n-6)/2 to n^2, i don't understand :D
a bit late but the reason is that -n-6 are insignificant in the scale of things. they don't do much to effect the overall complexity of the algorithm,
if u rm how polynomials work u usually take the biggest notation in which is n^2. the n/2 - 3 is thrown away since we don't want to complicate the complexity.
I luv you
❤❤❤❤❤❤❤
Hi randerson,
Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation