why is it true?? can anyone explain please…
Q8. Of time complextiy ......Frequently, the memory space required by an algorithm is a multiple of the size of input. State if the statement is True or False or Maybe
hello @manthan.joshi.jiit
answer will be true.
we always write space complexity as
O( c * N^K)
so we can say space complexity is some multiple of input size n