Click here to Skip to main content
12,401,832 members (61,466 online)
Rate this:
 
Please Sign up or sign in to vote.
See more: C
Hey guys i'm having trouble to tell which space complexity is the right.
pls make me understand Smile | :)
Posted 13-Feb-13 7:50am
idobry431

1 solution

Rate this: bad
 
good
Please Sign up or sign in to vote.

Solution 1

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
  Permalink  

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

  Print Answers RSS
Top Experts
Last 24hrsThis month


Advertise | Privacy | Mobile
Web02 | 2.8.160721.1 | Last Updated 13 Feb 2013
Copyright © CodeProject, 1999-2016
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100