It's about the problem 4 in project 1.

Let's extract the code as:

int j = 1;

while (j < n) {

j += log( j + 5 )

}

So how to calculate the time complexity?

- All categories
- Asymptotic Analysis (22)
- D&C (9)
- Greedy (1)
- Dynamic Programming (7)
- Backtracking/DFS/BFS (2)
- Branch & Bound (2)
- Graph Theory (14)
- NP-Completeness (4)

...