1. Suppose that there are 5 algorithms with time complexitiesO(nloglogn), O(nlog2n), O(n２), O(n2), and O( √ｎ), respectively. Pleasediscuss their efficiencies. [6%]
阿摩線上測驗
登入
阿摩線上測驗
登入
1. Suppose that there are 5 algorithms with time complexitiesO(nloglogn), O(nlog2n), O(n２), O(n2), and O( √ｎ), respectively. Pleasediscuss their efficiencies. [6%]