mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-10 16:00:36 +08:00
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
63 lines
1.4 KiB
Java
63 lines
1.4 KiB
Java
/**
|
|
* File: complexity_exercises.java
|
|
* Created Time: 2026-08-18
|
|
* Author: Hello Algo Team
|
|
*/
|
|
|
|
package chapter_computational_complexity;
|
|
|
|
public class complexity_exercises {
|
|
/* Sum using iteration */
|
|
static int sumIter(int n) {
|
|
int res = 0;
|
|
for (int i = 1; i <= n; i++) {
|
|
res += i;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* Sum using recursion */
|
|
static int sumRecur(int n) {
|
|
if (n == 1) {
|
|
return 1;
|
|
}
|
|
return n + sumRecur(n - 1);
|
|
}
|
|
|
|
/* Linear-time loop */
|
|
static int linearLoop(int n) {
|
|
int res = 0;
|
|
for (int i = 0; i < n; i++) {
|
|
res += i;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* Quadratic-time loop */
|
|
static int quadraticLoop(int n) {
|
|
int res = 0;
|
|
for (int i = 0; i < n; i++) {
|
|
for (int j = i; j < n; j++) {
|
|
res += j;
|
|
}
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* Logarithmic-time loop */
|
|
static int logarithmicLoop(int n) {
|
|
while (n > 1) {
|
|
n /= 2;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
assert sumIter(1) == 1 && sumRecur(1) == 1;
|
|
assert sumIter(4) == 10 && sumRecur(4) == 10;
|
|
assert linearLoop(4) == 6;
|
|
assert quadraticLoop(4) == 20;
|
|
assert logarithmicLoop(4) == 1 && logarithmicLoop(5) == 1;
|
|
}
|
|
}
|