1.5.2 Time Complexity Example #2

Time Complexity Examples

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

Data Structures using C and C++

C++ Programming

[sthembiso_mkhwanazi]

When you have to pause the video to read comments, to ensure that you are not alone who is enjoying the video. {A legendary teaching}

[darshantawte]

I did your C++ course on udemy and followed Algorithm series on youtube which helped me to form a really strong base and understand fundamentals in depth. I score 32/90 in my C course during my BE and thought coding was never for me as i always feared topics like pointers, recursion, structures etc.
Few days ago after completing my BE from a tier 3 college that too from Non CS/IT background i was able to clear TCS Digital with a 8LPA package. I really can't thank you enough.

[togglecode]

Thanks Abdul Bari bhai. Your lecture is very useful. Keep up.

[saa]

10:37 here, 1st loop will have a complexity of O(log(n)) & 2nd loop will have a complexity of O(log(log(n))... And since both loops are independent of each other (not nested loops), so the overall Complexity will be -> O(log(n)) + O(log(log(n)).... Which we can further reduce to "O(log(n))" by writing only the bigger/worst complexity...
Hope it will help :)
Abdul Bari sir mistakely written didn't written the complexity of whole program, and wrote the complexity of 2nd loop only...

[bob_factory]

Probably a lot of commenters already appreciated you for your work, but I wanted to say thanks to you. I am a self taught developer and because of which I lack the education needed for evaluating efficient complexities. I am still learning to get them right and in my struggles, its videos like yours that have really helped me out to understand better of them .
THANK YOU SO MUCH !!

[apusingh]

Brilliant job.. after 20 years of coding, I finally got it!

[abhijitnayak.]

I am studying in IIT Kharagpur>I have'nt seen this type of teacher in my whole life-🖤

[codewise]

at 10:37, I think time complexity will be ... logN + log(logN) ... which can be simplified to logN

[ankitshukla]

Sir aapka method of teaching un sabhe se acha tha, jin professional brands ke pass mai etne fees bhar ke ja chuka hu!
You Are The Best Teacher Sir!
GOD BLESS YOU :)

[urvashisharma]

i am in love with his teaching 😭😭😭...my exams are coming and ive been in quarantine for about 2 months now...never understood this subject...thank u so much sir because of you i think i can score well on my test

[rupeshpatil]

A true teacher and serious thank you for teaching all this. Your gesture, body language, the art of articulation, and simplification is remarkable. It reminds me of my school days. After 6 years of coding, I finally got Time complexity

[ambikapattanaik]

You are the God Father of algorithms God bless you with good health 🙏🙏 your free videos are very very helpful for many students🙏 thanks a lottt

[sunnyRVrocks]

It is you sir where computer science and mathematics merge with each other, and you make it look like a piece of cake. Loved the way you explain it

[rahulmathew]

This is the first video and class on the planet which explains and proves how we get the concept of log inside a big O notation . Thank you so much sir, your explanation is the best way of explaining Big O.

[JV-jcci]

You have such a fundamental understanding in how to teach in the most rudimentary way possible. Not all knowledgeable people can teach. You truly have a gift.

[mistersir]

The developer community all over the world must ackknowlege your existence sir. You have contributed so much.

[kyletulsie]

Hello Mr. Bari, I am using your videos to understand the content in my Advanced Algorithms courses in 2024. I must say you've done an excellent job at simplifying the explanations. I appreciate your time and dedication so much.

[miguelortiz]

The simplicity of your videos are great. I like how you break the algorithms into smaller steps and how you compare different functions so we can see the differences

[AdnanMazharuddinShaikh]

10:36 - For those of you who think that the overall TC is O(log n), yes you are right, but in the video he is referring to the TC of the second loop, i.e., O(log(log n)).

[scholli]

An indian guy without an hard annoying accent and insanely talented explainer! Ty Sir