leetcode涉及的算法复杂度计算

二分法算法复杂度logn
https://www.zhihu.com/question/20503898

int num1, num2;

for(int i=0; i<n; i++){ 
    num1 += 1;
    for(int j=1; j<=n; j*=2){ 

        num2 += num1;

    }
}

二分法的复杂夫
涉及到简单的log对数数学
https://juejin.im/entry/593f56528d6d810058a355f4

算法复杂度习题
https://www.shellcodes.org/Programming/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/%E7%AE%97%E6%B3%95%E7%9A%84%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90%E9%A2%98%E7%AC%94%E8%AE%B0.html