2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3

Recurrence Relation for Decreasing Function
Example : T(n)= T(n-1) + log n

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

Data Structures using C and C++

C++ Programming

[goatyt]

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.

[girava]

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)

[danielmartino]

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.

[nitinmahajan]

Wish had him as a professor a decade ago, these topics would be super interesting. You are doing a great service.

[asishraz]

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

[zizothegreat]

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 Youtube!" haha

[mahmoudalfayoumi]

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 <3 <3 <3 Thank Mr. Abdul Bari, have a unique teaching way "Mashallah" :)

[TheMsnitish]

It needs great patience to make wonderful videos like this! Love the way you teach without bringing lot of mathematical jargon like CLRS does.

[SHAHIDSHAIKH-bwys]

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

[davidotewa]

Doing Masters in Computer Science and your way of teaching is awesome.
I am almost finishing your Videos

[badalsarkar]

Outstanding!! I have been struggling to calculate time complexity of recursive functions, now everything is so clear to me. Thank you so much.

[badarikrishna]

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

[leonperianu]

you remind me of my math meditator... You explain clear, simple, and logical... Thank you :)

[zizothegreat]

You made a subject so simple that my professor and book provided for this course made 100x more difficult. Thanks again Abdul.

[amberpradhan]

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.

[muthierry]

Mr Bari, you are such a great Lecturer....just Amazing they way you explain.. Thank you again ..

[sleepypanda]

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

[Nazmussakib]

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!

[aishwaryasingh]

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

[rnjnmhta.catomato]

4:30 tight bound : Θ-notation (theta notation) is called tight-bound because it's more precise than O-notation and Ω-notation (omega notation).