in Algorithms edited by
120 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.
in Algorithms edited by
120 views

1 comment

this is not true as i can always write program which consume lot more space than time it takes
0
0

1 Answer

1 vote
1 vote
Best answer

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