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

Dark Mode

129 views

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?**