| [ studyingabroad ] in KIDS 글 쓴 이(By): anathema ( Mr.BIG) 날 짜 (Date): 1997년09월08일(월) 10시05분15초 ROK 제 목(Title): Re: 알고리즘 과목 문제 중에서.. Pf) Show max{f(n),g(n)} = theta{f(n), g(n)} for positive functions of f,g 1) Suppose f(n) >= g(n) for some n >= n0, which means max{f(n),g(n)} = f(n), and find out c1,c2 such that c2{f(n)+g(n)} <= f(n) <= c1{f(n)+g(n)} Let's set c1=1, c2=1/2, n>=n0 Then we got 1/2{f(n)+g(n)} <= 1/2{f(n)+f(n)} <= f(n) and f(n) <= 1*{f(n)+g(n)} /* 'cuz g(n) is postive */ 2) Otherwise, similarly as 1) We have determined that your whole system sucks ! ... Rage Against The Machine |