Ejercicio de análisis del tiempo de ejecución de varios tipos de bucles ======================================================================= Indica a cuál de estas opciones corresponde el tiempo de ejecución de cada uno de los siguientes apartados en función de N (no hace falta que lo demuestres): a) O(N) b) O(N^2) c) O(N^3) d) O(log N) e) O(N log N) f) O(log^2 N) =========================================== 1) int pasos = 0; for (int i = 0; i < N; i = i + 1) pasos++; =========================================== 2) int pasos = 0; for (int i = 0; i < N; i = i + 2) pasos++; =========================================== 3) int pasos = 0; for (int i = 1; i <= N; i = i * 2) pasos++; =========================================== 4) int pasos = 0; for (int i = N; i > 0; i = i - 1) pasos++; =========================================== 5) int pasos = 0; for (int i = N; i > 0; i = i - 2) pasos++; =========================================== 6) int pasos = 0; for (int i = N; i > 0; i = i / 2) pasos++; =========================================== 7) int pasos = 0; for (int i = 0; i < N * N; i = i + 1) pasos++; =========================================== 8) int pasos = 0; for (int i = 0; i < N * N; i = i + N) pasos++; =========================================== 9) int pasos = 0; for (int i = 1; i <= N * N; i = i * 2) pasos++; =========================================== 10) int pasos = 0; for (int i = 1; i <= N * N * N; i = i * 2) pasos++; =========================================== 11) int pasos = 0; for (int i = 0; i < N; i = i + 1) pasos++; for (int j = 0; j < N; j = j + 1) pasos++; for (int k = 0; k < N; k = k + 1) pasos++; =========================================== 12) int pasos = 0; for (int i = 1; i <= N; i = i + 1) pasos++; for (int j = 1; j <= N * N; j = j + 1) pasos++; for (int k = 1; k <= N; k = k * 2) pasos++; =========================================== 13) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 0; j < N; j = j + 1) pasos++; =========================================== 14) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = i; j < N; j = j + 1) pasos++; =========================================== 15) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 1; j <= N; j = j * 2) pasos++; =========================================== 16) int pasos = 0; for (int i = 1; i <= N; i = i * 2) for (int j = 1; j <= N; j = j * 2) pasos++; =========================================== 17) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 0; j < N * N; j = j + 1) pasos++; =========================================== 18) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 1; j <= N; j = j * 2) pasos++; for (int k = 0; k < N * N; k = k + 1) pasos++; =========================================== 19) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 0; j < N; j = j + 1) for (int k = 0; k < N; k = k + 1) pasos++; =========================================== 20) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = i; j < N; j = j + 1) for (int k = j; k < N; k = k + 1) pasos++; =========================================== 21) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 0; j < 10; j = j + 1) for (int k = 0; k < 10; k = k + 1) pasos++; =========================================== 22) int pasos = 0; for (int i = 0; i < N; i = i + 1) for (int j = 0; j < 10; j = j + 1) for (int k = j; k < 10; k = k + 1) pasos++; =========================================== 23) int pasos = 0; for (int i = 1; i < N * N * N; i = i * 2) for (int j = 0; j < 1000; j = j + 1) for (int k = 0; k < 1000; k = k + 1) pasos++; =========================================== 24) int pasos = 0; for (int i = 1; i < N * N * N; i = i * 2) for (int j = 0; j < 1000; j = j + 1) for (int k = 0; k < 1000; k = k + 1) for (int m = 0; m < 1000; m = m + 1) pasos++; =========================================== 25) int pasos = 0; for (int i = 0; i < N; i = i + 1) pasos++; for (int j = 1; j <= N * N * N; j = j * 2) pasos++; for (int k = 0; k < N; k = k + 1) for (int m = 0; m < N; m = m + 1) pasos++; ===========================================