Big O Notation & Time Complexity Analysis Tutorial

Welcome back to another video! In this video I am going to be explaining Big O Notation, as well as how to do Time Complexity Analysis with various algorithms! I have a bunch of examples in this video and I really want to focus on those examples and how to do Time Complexity Analysis! I hope that you find this video helpful!

⭐️ Timestamps ⭐️
00:00:00 | Overview
00:01:08 | What is Big O Notation?
00:03:35 | Big O Notation Explained
00:25:02 | Practice Question 0 (Easy)
00:26:26 | Practice Question 1 (Easy)
00:27:33 | Practice Question 2 (Easy)
00:31:36 | Practice Question 3 (Medium)
00:33:55 | Practice Question 4 (Medium)
00:36:55 | Practice Question 5 (Medium)
00:40:53 | Practice Question 6 (Medium)
00:43:33 | Practice Question 7 (Medium)
00:46:51 | Practice Question 8 (Hard)
00:51:22 | Practice Question 9 (Hard)
00:56:53 | Practice Question 10 (Hard)
01:00:13 | Practice Question 11 (Hard)

◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️

◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️

⭐️ Tags ⭐️
-Tech With Tim
-What is Big O Notation?
-Big O Notation Explained
-Time Complexity Explained
-What is Time Complexity

⭐️ Hashtags ⭐️
#TechWithTim #BigONotation #TimeComplexity

[ginadouglas]

Never understood big o notation until I found this video. Thank you so much!!

[aqifhebak]

For logarithmic time complexity (43:33), say that n is being divided by 2 over and over again until it reaches 1 and we want to calculate how many times these divisions happen. You can think of it like this :

n / 2 / 2 / 2 ... / 2 = 1

let's say that the division happened k times, that makes the equation like this:

n / 2^k = 1
<=> 2^k = n
<=> k = log2(n)

So the number of divisions is around log2(n).

[uncle-ffjq]

Genuinely informative, I really appreciate the breadth of your knowledge and how you use to to explain things in a concise way from multiple perspectives. Your content really helps me understand concepts I would've never thought I could grasp an understanding of and feel less intimidated about the learning process in general. Thanks!

[MishaSv]

Amazing tutorial!
Everything clearly explained and presented. This is a must watch video for everyone who is trying to start in the software engineering field as well as computer science!

[subramanianchenniappan]

Thanks . I am a java developer . This is useful for interview . Not many videos are there in youtube. and udemy on this topic

[mrmillmill]

Fantastic video as usual Tim! Finishing up my first view of it. Thorough explanation. Would like to see 2-4 examples per any given inefficient algorithm and show how to make each more efficient in terms of Big O notation. Thank you for an incredible video.

[noobypro]

this what I wished for

someone to make a good tutorial on big O notation

Thank you so much Tim!

[bluereino]

Actually helped me a ton! I was so lost when my professor was explaining it, but watching this gave me some clarity on the topic!

[coderanger]

This video is not good It's The maths explanations were kinda funny at times but you nailed it. Big O was hard for me to understand to do it quick enough but you made it easy. Kudooos

[yaboy]

taking data structures & algorithms in java this video is a blessing 🙏🏻thank you kind sir

[iytppim]

Thank you so much! I've watched so many of your tutorials and they've helped me so much to where it's definitely worth subscribing to your ProgrammingExpert course!

[rishabhsubrahmanian]

Let’s goooo big Tim! Thanks for the video yet again.

[mrmillmill]

Would like to see more on the other time complexities and also more on all algorithms from easy to advanced and showing examples of when each can be used in real world situations

[foxsermon]

I learned a lot from this video than 2 weeks of school.. great content 👍🏻 !!

[JulioDx]

Thanks for the thorough explanation and examples.

[sam]

I just started learning Big O notation in class and this was so helpful!!

[kellenrivers]

This is super helpful, Tim! I'm new to the field and have yet to have this concept explained in such a digestible manner. Working through ProgrammingExpert as well which it has been invaluable.

[kardasmanish]

The explaination you give is impeccable

[munizrobson]

Hey Tim Great Content as Always.✨
Thanks for Sharing it!🙏🏻
You Have Been an Inspiration for My Own 📺YouTube Channel!!!

[s]

Amazing video!
Looking forward to watching more videos related to other data structure concept!!