@@shyrenmore8140 because, n! = 1.2.3...n-1.n, and if you keep on multiplying n inplace of each number because n > c; you get 1.2.3.4.....(n-1).n < n.n.n.n.....n.n Therefore, Big -oh can be used
I love your way of teaching, very clear and simple. Our book Algorithm Design by Goodrich and Tamassia is an unnecessary mess. Education should depart from a concise and clear base, otherwise it seems as the author is trying to show off instead of explaining. Your style is of a real professor. You should right a book on Algorithm, you are a real professor.
Sir, you must be aware that I am commenting on each and every video of this playlist, not to gain attention but to prove my sincerity towards your teaching. I have set up this month's target to finish all of the videos in this playlist. Every day, I watch a minimum of 3 and a maximum of 4 videos from this playlist, so that in a week I will able to complete a minimum of 21 and a maximum of 28 videos and in a month, all these 84 videos will get completed. The first-week target already completed now jumped in the second-week target. The reason is your way of teaching and the valuable information we all are gaining through watching it. Lots of love and respect for you Sir. Thank you so much. I will be jumping to the next video of this playlist. More power to you and keep the great work that you are doing. - Gareeb CODER
When I graduate in a year, if I even have the chance to thank the ones that help me along this college journey, I will sure to thank you publicly. I would say something along the lines of "I want to thank god, my mom for supporting me, and most importantly Abdul from RUclips!" haha
Sir really when i show that topics available in your channel then my level of confidence of those topics increase to 💯 no matter how complex those theory or topics .❣️ Thank you sir . 😌
his teaching is so interesting that when he said 12:20 that you'll see the answer in next video my emotions were same as if I watched some super awesome web series on Netflix and they left the episode at the good part. I clicked the next video quickly just like I click on next episode of web series quickly!!!
00:02 Understanding the time complexity of a given algorithm. 01:17 Recurrence relation T(n) = T(n-1) + log n 02:54 Recurrence relation T(n) = T(n-1) + log n results in T(n) = log n factorial. 04:38 The time complexity is O(n log n) 06:21 Recurrence relation T(n)=T(n-1) + log n 08:24 Recurrence relation T(n) = T(n-1) + log n results in O(n log n) 09:43 Recurrence relation T(n)= T(n-1) + log n results in O(n^3) 11:14 Understanding the recurrence relation T(n) = T(n-1) + log n.
Salute to your patience, writing each line and explaining thoroughly. I remember how I used to spend lot of time scratching my brain in understanding in college I used to write each line and understand. It feels great when you explain in this way..!! 🙌🙌
Teaching the hardest topics in an easy manner is the hardest job in the world & you have made it & helped out thousands of students. Respect Sir. Wishing you a good health & a happy life. Jazak Allahu Khair!
Shouldn't the relation at 7:42 be T(n)= T(n-k) + log(n-(k-1)) + log(n-(k-2))+......+log(n-1) + log(n)? and btw this whole playlist is a lifesaver! Gotta appear for my exams next week and I hope to do well ;)
@@KRVIJAY-es8xl What I am saying is that when you download the video it has no face, meaning no watermark. It is just like a video which has been captured and got uploaded, the head you see now is not part of the video but a link to the channel.
Really glad I stumble into your Algorithm Playlist, with this Online learning going on, I've never been able to focus on my class, it's few weeks into the end of the semester and your style of teaching really understandable rather than other that using fancy words! Thank you! By the way why don't you upload again sir?
Sir i really appericiate your efforts the ways you teach us its really fantastic your video lectures helps me to understand the concepts in more detail thanks alot sir
I have a question, in the last substitution (8:00) you wrote log(1)+...+log(n) instead of log(1)+...+log(k). Won't the result be correct only for T(n-k)? You know is log(1)+...+log(n) after the resolution of n-k=0. Btw, love the simplicity of your explanations, you're the best
Question: rather than expanding in terms of factorial, can we not make the argument that each of the log calls is ~log(n) (the constant doesn't matter) and we have n of them so nlog(n)? EDIT: okay i guess this is addressed partially at the end, thanks!
At 4:00 why you have started from n to 0(up to down).. While in previous video, we have calculated from bottom to top i. e. 0+1+2..+n. Through both cases we get different answer
watch his time complexity videos from lec 1...u will understand how lower and upper bound works.. Here,f(n)= log(n!) lets calculate theta bound.. c1g(n)
sir have a question, logn+log(n-1)+log(n-2)+log(n-3).....+log(1). In this if you take out log as common factor then it should be log[n+(n-1)+(n-2)+(n-3)+(n-4)+.....+1)] but you have taken as log[nx(n-1)x(n-2)x(n-3)x(n-4)x.....x1)]. Could you please explain how?
You misunderstood the property of log. Property: log ab = log a + log b so: log(1*2*3*4 .... (n-1)*n) = log 1 + log 2 + log 3 + log 4 + .... + log (n-1) + log n
![Seungmin "그렇게, 천천히, 우리(As we are)" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/kAzmhLHePqU/mqdefault.jpg)
3:56 If someone is wondering how he magically got this (very rarely happens)
log a + log b = log(a*b)
hence, log(n) + log (n-1) .. + log(2) + log(1) = log(n*(n-1)*(n-2)...*1) = log(n!)
O(log(n!)) = O(log(n^n))
log(a^b) = blog(a)
hence, O(log(n^n)) = O(nlogn)
I was looking for this. Thanks.
Thanks for this. My math is really bad so I had trouble understanding that part.
thanks broo
How did n! become n^n?
@@shyrenmore8140 because, n! = 1.2.3...n-1.n, and if you keep on multiplying n inplace of each number because n > c; you get
1.2.3.4.....(n-1).n < n.n.n.n.....n.n Therefore, Big -oh can be used
I like how he looks at me as if I am not paying attention in the back bench and about to get a detention. You are a legend Bari.
i thought he only looks at me.
I love your way of teaching, very clear and simple. Our book Algorithm Design by Goodrich and Tamassia is an unnecessary mess. Education should depart from a concise and clear base, otherwise it seems as the author is trying to show off instead of explaining. Your style is of a real professor. You should right a book on Algorithm, you are a real professor.
Exactly, I agree.
yes 💯💯💯
I agree he is a great teacher
Agree with you
Wish had him as a professor a decade ago, these topics would be super interesting. You are doing a great service.
Sir, you must be aware that I am commenting on each and every video of this playlist, not to gain attention but to prove my sincerity towards your teaching. I have set up this month's target to finish all of the videos in this playlist. Every day, I watch a minimum of 3 and a maximum of 4 videos from this playlist, so that in a week I will able to complete a minimum of 21 and a maximum of 28 videos and in a month, all these 84 videos will get completed.
The first-week target already completed now jumped in the second-week target.
The reason is your way of teaching and the valuable information we all are gaining through watching it.
Lots of love and respect for you Sir. Thank you so much. I will be jumping to the next video of this playlist.
More power to you and keep the great work that you are doing.
- Gareeb CODER
My Target is to complete this whole series by the End of this month
@@codingdaily4094 _ Great. Same here. Let's see, how far we will go till the end of this month
@@asishraz6173 Okay bro
i just completed 25 videos in one day
@@codingdaily4094 did u do it bro? congrats
When I graduate in a year, if I even have the chance to thank the ones that help me along this college journey, I will sure to thank you publicly. I would say something along the lines of "I want to thank god, my mom for supporting me, and most importantly Abdul from RUclips!" haha
One year later update?
@@NewRohan xd
Two year later update
Three years later update?
Four years later update?
I'm taking a master program in CS, and you don't know how these lessons helped me to make full marks in the exams
and i am in BS 2nd semester now or taking this lectures this sir is amazing
It needs great patience to make wonderful videos like this! Love the way you teach without bringing lot of mathematical jargon like CLRS does.
Doing Masters in Computer Science and your way of teaching is awesome.
I am almost finishing your Videos
Sir really when i show that topics available in your channel then my level of confidence of those topics increase to 💯 no matter how complex those theory or topics .❣️
Thank you sir . 😌
Wonderful explanation! What clarity! Sir is a master of algorithms.
I believe that the good teacher is the one who is not only smart but explain very well.No words, Best teacher so far. Thank you and God bless you.
his teaching is so interesting that when he said 12:20 that you'll see the answer in next video my emotions were same as if I watched some super awesome web series on Netflix and they left the episode at the good part. I clicked the next video quickly just like I click on next episode of web series quickly!!!
00:02 Understanding the time complexity of a given algorithm.
01:17 Recurrence relation T(n) = T(n-1) + log n
02:54 Recurrence relation T(n) = T(n-1) + log n results in T(n) = log n factorial.
04:38 The time complexity is O(n log n)
06:21 Recurrence relation T(n)=T(n-1) + log n
08:24 Recurrence relation T(n) = T(n-1) + log n results in O(n log n)
09:43 Recurrence relation T(n)= T(n-1) + log n results in O(n^3)
11:14 Understanding the recurrence relation T(n) = T(n-1) + log n.
Outstanding!! I have been struggling to calculate time complexity of recursive functions, now everything is so clear to me. Thank you so much.
I don't know if this helps but I try to watch some of the adds without skipping cuz you deserve it. May Allah bless you
You made a subject so simple that my professor and book provided for this course made 100x more difficult. Thanks again Abdul.
Salute to your patience, writing each line and explaining thoroughly. I remember how I used to spend lot of time scratching my brain in understanding in college I used to write each line and understand. It feels great when you explain in this way..!! 🙌🙌
4:30 tight bound : Θ-notation (theta notation) is called tight-bound because it's more precise than O-notation and Ω-notation (omega notation).
Teaching the hardest topics in an easy manner is the hardest job in the world & you have made it & helped out thousands of students. Respect Sir. Wishing you a good health & a happy life. Jazak Allahu Khair!
8:49 when he sums all the part 1,2 and 3. Amazing trick!! I didn't have to prove nothing just understand the power the power of multiplication!!
you remind me of my math meditator... You explain clear, simple, and logical... Thank you :)
You should take pride in your teaching skills, it is a skill that not many have, nice work
Thank you so much sir . our teacher is teaching us i even not understand on his lecture but you clear my concept . A lot of love from Afghanistan .
I have been watching your videos for a while now and it has never been easier than this. Kudos to you!
Thank you so much. :)
You ate when you explained how to know the time complexity straight away!!!
Mr Bari , you are such a great Lecturer....just Amazing they way you explain.. Thank you again ..
You explanation is too clear and lucid!Thanks a lot for these great lessons!
Thanks!
Such a Legend this Man is !
Thank you Sir for making our lives simpler !
OUR INDIA HAS THE BEST TEACHERS
Top-notch teaching. Thank you for making this so clear and easy to understand.
Crystal clear explanation. You are doing great service for the learner.Huge Respect ...!!
Thank you Abdul - all of your videos are priceless! you're a legend. Thank you for helping to improve.
Excellent teaching skills.Best Ds & Algo teacher .Thank you for making this topic easy to learn and understand.
Shouldn't the relation at 7:42 be T(n)= T(n-k) + log(n-(k-1)) + log(n-(k-2))+......+log(n-1) + log(n)? and btw this whole playlist is a lifesaver! Gotta appear for my exams next week and I hope to do well ;)
I was thinking the same
Love it.. at the last the short cut was awesome i was searching for that and i got here
Your way of teaching is excellent, Thank you sir....
abdul bari hocam, karizma bir dagsa sen everestsin
Thank you so much sir. You've really help me.
03:55 property of logarithms = log(a) + log(b) = log(a*b)
You are a genius, because you simplify it so beautifully.
I love abdul sir! beautiful job done
No words to say simply fantastic
This Professor is a LEGEND!
Hello Sir. Put A Water Mark On Your Videos Such That They Won't Get Stolen.
Have A Nice Day.
@@abdul_bari youtube has a feature to put watermark on the videos .. its somewhere in the settings
He literally has his face on these videos, a watermark would be completely redundant here.
@@KRVIJAY-es8xl The video has no face when is downloaded.
@@sthembiso_mkhwanazi that's literally impossible. Cropping the face would cause half the video to be cut off
@@KRVIJAY-es8xl What I am saying is that when you download the video it has no face, meaning no watermark. It is just like a video which has been captured and got uploaded, the head you see now is not part of the video but a link to the channel.
Thank you very much for the lecture. You are the best teacher!
Excellent teaching sir...i have already taken ur data structure course from udemy...it is just luv
Tai naki??ami ke bol to
Really glad I stumble into your Algorithm Playlist, with this Online learning going on, I've never been able to focus on my class, it's few weeks into the end of the semester and your style of teaching really understandable rather than other that using fancy words! Thank you!
By the way why don't you upload again sir?
At 7:40, shouldn't your inductive case be T(n) = T(n-k) + log(n - k + 1) + log(n - k + 2) .... + log(n - 1) + log(n)? Love your videos!
Yeap. I got the same result. I was confused at first that's why I was checking comments and found your comment. Basically he skipped a line.
Exactly
At 11:30, it should be O (n^2) when T(n-2)+1 = n/2*n=n^2/2
Sir at 4:15 how did logn+log(n-1)..... change the '+' change to '*' = [n*(n-1)...]?
I think you got the answer by now but its according to formula,
log a*b = log a + log b, he has applied it reverse i.e
log a + log b = log a*b
@@Thepankaz1 you saved my life.... thank you very much for the response
First time I solved this math. Thanks to you 🙏❤️
Thank you very much. You are a genius.
You are best algo teacher in the world
How i wish u were my Professor. I’m sure i would have a solid computer science foundation:)
what a wonderfull video 🤸♂️🤸♂️
I swear , He teaches better than my actual university lecturer
The last part😍😍😍 Thank You🙏🙏🙏❤❤❤❤
best teacher ever . Want yo meet you sir
doing a great job sir.
thank u so much sir.
Finished this one too. Awesome explanation sir.
Your way of teaching is Excellent
Thank u so much sir and the best part was short cut method. God bless u sir.
This man save my life!!
Amazing! It is explained very well.
Sir Sir Sir!....Love u❤️
why the log n magically appear, previous videos on n-1 and n+1
Nice 🌼🌸
BEST TEACHER!!!!!!!!!!!
your way of teaching is awesome
Sir i really appericiate your efforts the ways you teach us its really fantastic your video lectures helps me to understand the concepts in more detail thanks alot sir
You are the best teacher!
Amazing lecturer!
Perfection level is 💯
Thanks for the shortcut
Great Great level of explanation.
Excellent Sir ❤
i just love u sir!!!
I have a question, in the last substitution (8:00) you wrote log(1)+...+log(n) instead of log(1)+...+log(k). Won't the result be correct only for T(n-k)? You know is log(1)+...+log(n) after the resolution of n-k=0.
Btw, love the simplicity of your explanations, you're the best
Yes cause he skipped that step and another way to think is he already mentioned we assume n=k so we can use any of those.
thank you , It helped a lot 🙌
thanks for your great video
Thank you professor. Excellent teaching sir.
a gold mine in youtube
10:07 : order for other recurrance relations.
Sir may Allah bless you
Sir, jo apne 7:30 pe log1 likha h uski jagah log(n-k+1) hoga because sir ham phle to use k se hi replace kar rhe h
@@abdul_bari ha sir
04:47 logarithm distribution
This is amazing. Thank you so much.
Question: rather than expanding in terms of factorial, can we not make the argument that each of the log calls is ~log(n) (the constant doesn't matter) and we have n of them so nlog(n)?
EDIT: okay i guess this is addressed partially at the end, thanks!
Thank you , I appreciate your help so much
At 4:00 why you have started from n to 0(up to down).. While in previous video, we have calculated from bottom to top i. e. 0+1+2..+n. Through both cases we get different answer
No hatred Only likes for this legend
Someone please give sir a medal
Level ha sir apka .. Thank you so much.
Can someone explain me at 4:47 why he took upperbound of log(n factorial)......wht was the need ?
watch his time complexity videos from lec 1...u will understand how lower and upper bound works..
Here,f(n)= log(n!)
lets calculate theta bound..
c1g(n)
This is very helpful :)
thanks you sir. great video
sir have a question, logn+log(n-1)+log(n-2)+log(n-3).....+log(1). In this if you take out log as common factor then it should be log[n+(n-1)+(n-2)+(n-3)+(n-4)+.....+1)] but you have taken as log[nx(n-1)x(n-2)x(n-3)x(n-4)x.....x1)]. Could you please explain how?
I have the same question .. i stopped the video after this formula.. then i have seen the comments .. you already asked this question.
log(n!) = log(1) + log(2) + log(3) + … + log(n)
You misunderstood the property of log.
Property:
log ab = log a + log b
so:
log(1*2*3*4 .... (n-1)*n) = log 1 + log 2 + log 3 + log 4 + .... + log (n-1) + log n
Bhut aacha sir