V2EX = way to explore
V2EX 是一个关于分享和探索的地方
Sign Up Now
For Existing Member  Sign In
lbfeng
V2EX  ›  问与答

求解释一道 recursion-tree 的算法题

  •  
  •   lbfeng · Oct 1, 2015 · 2650 views
    This topic created in 3861 days ago, the information mentioned may be changed or developed.

    本人算法渣,没搞懂 n^log4 3 是怎么得出的。

    3 replies    2015-10-01 08:54:46 +08:00
    hsyu53
        1
    hsyu53  
       Oct 1, 2015 via Android   ❤️ 1
    3^(log_4 n) = n^(log_4 3)
    chengzhoukun
        2
    chengzhoukun  
       Oct 1, 2015   ❤️ 1
    算复杂度?
    看算法导论主定理相关内容
    zhyu
        3
    zhyu  
       Oct 1, 2015
    正解是 1 楼,收到感谢的是 2 楼(((
    About   ·   Help   ·   Advertise   ·   Blog   ·   API   ·   FAQ   ·   Solana   ·   3910 Online   Highest 6679   ·     Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 · 35ms · UTC 00:10 · PVG 08:10 · LAX 17:10 · JFK 20:10
    ♥ Do have faith in what you're doing.