Data Structures and Algorithms
Ladybug Podcast
00:00
How to Calculate the Performance of Your Algorithms
When we say O of n, n is really just the upper bound. And on top of that, we can drop the coefficients and the constants. So if you are doing something like 3 n plus 1 times or something like that, that would just be n efficiency. You can simplify it down to those kind of families instead of getting real niche there. We're going to link some really good resources for you down in the show notes.
Transcript
Play full episode
