‫So our next big go is of one.
‫And to explain this, I'm going to build out a function that we're going to call add items.
‫And all this is going to do is return in plus MN and this is our first big O where the number of operations
‫does not change as in becomes larger.
‫So in this situation, if N was one, we would have one operation, which is the addition.
‫But if N went all the way to a million, we would still have one operation, which is the addition,
‫and that is o of one.
‫But what if instead of having n+ n we had in plus n less rn.
‫Well, now this would be two operations and you could call that o of two.
‫But as you may have guessed, we're going to simplify this and we're still going to call this o of one.
‫So now let's take a look at O of one.
‫On the graph.
‫So OV one is just that purple line across the bottom.
‫It is the most efficient big o because as in becomes larger, the number of operations does not become
‫larger.
‫So any time that you can do something with o of one time complexity is going to be very efficient.
‫And that is our overview of of one.