Done in java

Task #3 Big-O based Runtime Analysis (10 pts)

1. Give the Big-O runtime of the following code parts as much as tight.

for (int i = 0; i < N; i++) { sequence of statements } for (int j = 0; j < M; j++) { sequence of statements } for (int i = 0; i < N; i++) { for (j = 0; j < N; j+=2) { sequence of statements } } for (int k = 0; k < N; k = k+4) { sequence of statements } for (int i = 0; i < N; i++) { for (int j = N; j > i; j--) { sequence of statements } } for (int i = 0; i < N; i++) { for (int j = N; j > i; j-2) { sequence of statements } }

for (int i = 0; i < N; i++) { for (int j = i+1; j < N; j++) { sequence of statements } } for (int i = 0; i < N; i++) { for (int j = N; j > i; j= j--) { sequence of statements } } for (int i = 0; i < N; i++) { for (int j = 1; j < N; j= j*3) { sequence of statements } } for (int i = 0; i < N; i++) { for (int j = 1; log(j) < N; j= j*2) { sequence of statements } } for (int i = 0; i < N; i++) { for (int j = 1; log(j) < N; j= j+1) { sequence of statements }