Big O notation and time complexity, explained.

Check out Brilliant.org ( a website for learning math and computer science concepts through solving problems. First 200 subscribers will get 20% off through the link above.

Special thanks to Brilliant for sponsoring this video.

This was #7 of my data structures & algorithms series. You can find the entire series in a playlist here:

Also, keep in touch on Facebook:

Nguồn:https://dothihoa.com/

Impressionant !

PLot twist. What if the info he's giving us is 100% wrong 🙂

I can tell this video is gonna suck because it's too long.

I sat in class for the whole semester struggling to figure this out. Then I see your video and understand it in 30 mins. College is a joke.

23:05 why for each is O(1)?, it will increase time when array is bigger, shouldnt this be O(n)?

Edit: nvm, I understand it now

Thanks

When is this used in the real world

I just knew this topic because I have to take an exam for a job application but he explained it very well! I didn't know I can watch, listen and learn from a youtube video this easy. Omg thank you!

Cs dojo can you make one crash course in data structures and algorithms?

Hi, thanks a lot for this video about big O notation !! May I know if you have videos on O(nLogn) complexity ?

how time complexity became 0(n2)???? if input itself is n2 . i think some correction is needed, the time complexity is 0(n) because for n2 inputs loop iterated n2 times.

By far the most comprehensive explanation of time complexity and big O notation I've ever met, so simple and clear. Thank you!

Excellent presentation of Big O! Very clear and easy to follow, I plan to recommend this.

be gonenotationThanku 😇😇😇

Best tutorial ever seen!

in 24:50 isnt th coefficient n instead of c5?

This whole video could have been 5 minutes long and it wouldn't have made any difference

Where the hell was this guy when I was doing my CS Degree !!!!!!!

Not bad, however, you completely left out O(log n) and O(n log n) complexities!.

can the co-efficient of T be -ve ?

Thank you sir for your great work.please do more videos on data structures.

I’m studying at the University of Lincoln (UK) and you explained this way better than my professor in half the time.

Excellent videos

@7:14 T = an + b.

n = size of array

a & b are constants. What constants? You also call them "coefficients". What does this mean in context of the equation and the problem it's derived from?

"a numerical or constant quantity placed before and multiplying the variable in an algebraic expression "

T = cn^2 + dn + e — I'm lost. What does this represent?

then ads are so fuckin irritating!!

i am a lecturer of a certain University………….thanks for the tutorial🙌🙌

At 23.06 you wrote the time for total += i -> O(1) if we treat total = total + i then here we are doing assignment and arithmetic operation that is + so it should be O(2) right?

After I finish my course I want to send this vid to my professor and tell him to explain it this way to make the student's life easier.

Thank you !!

That's great video for beginner