How to make difference between space complexity O(1) to O(n)

Question

1.00/5 (2 votes)

See more:

Hey guys i'm having trouble to tell which space complexity is the right.
pls make me understand :)

Posted 13-Feb-13 7:50am

1 solution

Add a Solution

Treat my content as plain text, not as HTML

…

Sign in to your account

Download, Vote, Comment, Publish.

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Alexandrovich Kryukov · Answer 1 · 2013-02-13T07:56:00

Sure:
http://en.wikipedia.org/wiki/Space_complexity[^],
http://en.wikipedia.org/wiki/Space_complexity_theory[^],
http://en.wikipedia.org/wiki/Big_O_notation[^].

I think last article is quite clear. O(1) means that space complexity asymptotically does not depends on the size of input data; O(N) means it's linearly proportional.

—SA