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?