Exploratory question (means google and figure out the answer!)

What is the definition of space complexity of an algorithm?

Space complexity is ...

What would be space and time complexities of the following code snippets (in terms of Big-O)?

a)

int mystery(int x, int y, int z)

{

int r=x+y+z;

return r;

}

Time:

Space:

b)

void foo (int[] mylist){

for (int i=0; i

//print stuff

}

Time:

Space:

Does space and time complexities dependent on each other in some way? If so, how?