Timeline for Time Complexity of Logarithmic For loop
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 20, 2021 at 19:04 | comment | added | Turing101 | Thanks Rostami.. :) | |
| Jul 20, 2021 at 19:03 | vote | accept | Turing101 | ||
| Jun 23, 2021 at 19:12 | history | edited | ErroR | CC BY-SA 4.0 |
added 141 characters in body
|
| Jun 23, 2021 at 18:45 | history | edited | ErroR | CC BY-SA 4.0 |
added 4 characters in body
|
| Jun 14, 2021 at 12:35 | history | edited | ErroR | CC BY-SA 4.0 |
added 191 characters in body
|
| Jun 14, 2021 at 12:35 | comment | added | nir shahar | Cool, looks good now. Its still not very intuitive to make this into a recursive formula, but the solution is correct :) | |
| Jun 14, 2021 at 12:33 | comment | added | ErroR | @nirshahar I edit my solution. | |
| Jun 14, 2021 at 12:32 | history | edited | ErroR | CC BY-SA 4.0 |
added 191 characters in body
|
| Jun 14, 2021 at 12:29 | comment | added | nir shahar | $i$ runs from $1$ to $n$ with jumps of multiplying by $2$. There are a total pf $\log(n)$ such $i$'s, but they are not $1,2,\dots,\log(n)$. Rather, they are $1,2,4,8,\dots,n$ | |
| Jun 14, 2021 at 11:00 | history | answered | ErroR | CC BY-SA 4.0 |