Which one of the following is an example for exponential time complexity?( )
A: O(2n)
B: O(n2)
C: O(n)
D: O(1)
A: O(2n)
B: O(n2)
C: O(n)
D: O(1)
举一反三
- Which one of the following is an example for exponential time complexity? A: O(2<sup>n</sup>) B: O(1) C: O(n) D: O(n<sup>2</sup>)
- T(n)=2*T(n/2)+ O(n)，该递归方程描述的算法时间复杂度是 A: O(n2) B: O(nlog2n） C: O(2n) D: O(n)
- An algorithm has running time $T(n)$, which satisfies $T(n) = 4T(n/4) + O(n)$.So, its running time is _____. A: $O(n\log n)$ B: $O(n)$ C: $O(n^2)$ D: $O(n^2\log n)$
- Time complexity of accessing data stored in vertex v: 访问顶点v中存储的数据的时间复杂度： A: O(1) B: O(n) C: O(nlgn) D: O(n^2)
- 冒泡排序的时间复杂度是（） A: O(n 2 ) B: O(nlog 2n) C: O(n) D: O(log 2n)