
Data Structures and Algorithms
Ladybug Podcast
00:00
The Big O Complexity Chart
O of one is constant, which means that no matter what your input is, it's only doing one thing. If you have 100 items in an array and are looping through it, it's going to run 100 times. O of n where it runs the same amount of time as the number of inputs you have. So does it fit between big O and big Omega? Yeah, those ones I have really not used.
Transcript
Play full episode