it will be o(1) space complexity................we are using all the 101 memory space of the array for every input combination .........here the memory space is not depended on ...n... how could be the space complexity is o(n)
Here the array size is dependant on the value of n (actually the max possible value). As we assumed the max value is 100, we declared an array with 101 elements. If the max possible value of n is 1000, then we have to declare an array with 1001 elements. Hence the space complexity is O(n).
even[101] Ekta array jar vitre 101 ta variable ase. First for loop diye protita variable a 0 value assign kora hoise. 2nd for loop diye জোড় position er variable a 1 value assign kora hoise. So ei variable er value ekhon ei rokom-- even[0]=1; even[1]=0; even[2]=1; even[3]=0; even[4]=1; even[5]=0; ... ... even[56]=1; Cause eta jor number. R Jor position er value 1. Programming a 1 maneh true and 0 maneh false. if(even[56])=if(1)=if(true) Condition satisfied. So if block er code execute Hobe. Hope you understand.
