4. Big O notation (Space complexity)

Alright, last video on big O for a little while. It's space complexity - but it ain't that complex.... Right? Am I right.....? Alright!

Follow me on insta for cookies and milk mode photos:

[rosemwangi]

I like the authenticity in these videos. The explanations are clear. Helpful!

[bwbs]

Why don't you account for the assignments in the for loop? i++ is an assignment (i = i +1;) so why is that not accounted for?

[julianhyungmin]

Thank you. Very nice, clear explanation

[myspexg]

Thanks however variable assignment doesn't always equate to o(n). If we stored the sum it will be o(1) since the space will always be 1.

[pavelllamocca]

Hi Adam Coder. In your first example, the reason why the space complexity is O(1) is because you are counting "let i=0" from the loop??

[arjay_]

what if we set an array to default fixed values [1, 2, 3, 4, 5]? would it be O(1)?

[irenenamagembe]

How can I get connected to you as a friend