BTW...
所在版块:求学狮城 发贴时间:2003-10-29 23:56

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
1) Your question is NOT a Java question. Please try to use a more appropriate subject line next time.

2) The "prove" I gave provides only a lower bound. For the upper bound of the big-Theta (big-Theta ~= big-O + big-Sigma), you can propose a simple sequential scanning algorithm.
.
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!

Flying @way 吳穎暉
 相关帖子 我要回复↙ ↗回到正文
A java question: 最近不太好   (127 bytes , 531reads )
Theta(n) Flying   (128 bytes , 266reads )
BTW... Flying   (280 bytes , 242reads )