edited by
285 views
0 votes
0 votes
is it true that space complexity is always less than equal to time complexity i.e. S(n) = O(T(n))

 I think it is.
edited by

1 Answer

Best answer
1 votes
1 votes

that's a wrong conclusion.

suppose a algo --

it is given to  compute for a number  its square and cubes as--

for number at index 0 in array store its value in new array at 0 position,square at 1st position and cube at 3 rd position.. so on... now will its space complexity will be equal to time complexity?

selected by

Related questions

5 votes
5 votes
2 answers
1
Shivani gaikawad asked Aug 17, 2018
1,013 views
What is the space complexity of the following code?$O(logn)$ $O(n)$$O(nlogn)$ $O(1)$
1 votes
1 votes
1 answer
2
0 votes
0 votes
3 answers
3
iita asked Dec 31, 2016
315 views
4 votes
4 votes
1 answer
4