 So now the question I want to give you is if I had this algorithm, what is it's? Oh, well, I guess what is It's big. Oh So it's not in because if we kind of looked through it We already know that this is only going to be a one and this is going to be the same thing because all we're doing is We're creating Some memory some variable in memory not really doing much there Same kind of thing. I need to look at this This is still going to make me a t of one this I have to access in memory So that's a one and that's as well a one and then the addition of those two is Another one so if we kind of added these up one two three four five six This has a t in of six But I didn't ask for t of n. I asked for oh And so what happens is one of the things that we'll do is we will sort of one of the rules is to Drop the Multiplicative big fancy word for basically saying this Algorithm right here. Just like we were seeing a second ago. I had something like four in plus. I think it was five I don't really care about this because it's super small and In theory, I really didn't care about that four. I really just Needed the dependent number and so if we kind of looked at this T of n right now It's a six. Okay. That doesn't give me much because there's no in and drop what do you mean drop the multiplicative? What we could do is we could assume we could think about this as if it was six times one See this is what we would call Running in a constant time Just like this algorithm here was dependent on an in This is dependent on that that one that constant time and so as a result since we're going to drop the multiplicative We could say that this algorithm is Biggo of one