[問題] 演算法問題

看板Prob_Solve (計算數學 Problem Solving)作者 (暴力小孩)時間13年前 (2011/10/05 20:41), 編輯推噓0(000)
留言0則, 0人參與, 最新討論串3/8 (看更多)
For a given constant c 屬於 R,we define the iterated function f by f(n) = min{i>= 0 :f(i)(n)<=c} (i是在f的上面) In other words, the quantity f (n) is the number of iterated applications of t\ he function f required to reduce its argument down to c or less. For each of the following function f(n) and constant c, give as tight a bound as possible on f*c (n). f(n) c 1. n^1/2 1 2. n^(1/3) 2 3. n/lgn 2 剩下這幾題不知道怎麼估i 的bound= = -- ╲ ◢▅◢▅◣ ╱ 親愛的妳要找什麼阿~██ ███在前面!!! ◤◥◥ ◢◢◢ ◥◥我找到了! 為什麼...我的心裡 你在這邊 ◣-- 會有種蛋蛋的哀傷呢? ◣▽ ◢ 等我一下唷~ ▂▂▂◣╯ ▂▂▂▂▂▂▂ψQSWEET -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.123.215.39
文章代碼(AID): #1EZ51kfE (Prob_Solve)
文章代碼(AID): #1EZ51kfE (Prob_Solve)