find complexity

Problem 1

Find out the computational complexity (Big-Oh notation) of the code snippet:

Code 1:

for (int i = n; i > 0; i /= 2) {

for (int j = 1; j < n; j *= 2) {

for (int k = 0; k < n; k += 2) {

// constant number of operations here

}

}

}

Code 2: Hint: Lecture Note 5, Page 7-8

void f(int n) {

if (n > 0) {

DoSomething(); // O(1)

f(n - 1); f(n - 1);

}

}