算法导论中的两道题
jim77 2003-09-15 07:49:43 1.Prove that the running time of an algorithm is (-)(g(n)) if and only if its worst-case running time is O(g(n)) and its best-case running time is 欧米嘎(g(n)).
2. Prove that o(g(n))交w(g(n)) is empty set.
(-)符号就是“theta”。。。。
题目很简单,初学者求教。谢谢!