1. write out the recursive and the non-recursive pseudo-codes for computing
n
the binomial coefficient n as defined in follows: C m = n!/m!(n-m)!
C m
2. 給定n個正整數。在這n個正整數中找到兩個相異數x,y,使得(x+y)(x-y)有最大值，
請問這個問題存在O(n)的演算法嗎?如果有，請說明你的演算法；
如果沒有，請說明你的理由
3. please analyze the time complexity of the following program segment.
for(I=0; I< n; I++)
{
J=1;
While (J>=2)
J=J/2;
}
４.there is a float array A[18][10] (size of (float)=4). If the address of
A[11][2] is 10E9 . What is the address of A[15][13]?
(16)
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.170.83.113