solution-review-big-o-of-nested-loop-with-multiplication__complexity-measures__data-structures-for-coding-interviews-in-java
Topic | Replies | Views | Activity | |
---|---|---|---|---|
Why log2(n) is not multiplied when calculating number of executions for inner loop statements? |
![]() ![]() ![]() |
4 | 39 | February 13, 2021 |
Why Complexity Of while loop is nLog(n) |
![]() ![]() ![]() |
3 | 162 | December 9, 2020 |
Why log(n) + n = O(n)? |
![]() ![]() |
2 | 51 | March 11, 2020 |
Log2(n)*(4n-4) transformation for nested sum++ |
![]() ![]() ![]() ![]() ![]() |
5 | 191 | December 18, 2019 |