登陆题目详情
单选题 计算T(n) T(n) = 1, n=0 T(n) = 2T(n-1) +
, 其它
A. 
B. -1
C. +1
学科：算法分析与设计
时间：2024-09-26 04:54:25
相关题目
相关作业
题目1单选题
算法分析包括最好情况下的时间复杂度(时间复杂度下界)、最坏情况下的时间复杂度(时间复杂度上界)和平均情况下的时间复杂度(时间复杂度均值).实践表明可操作性最好的,且最有实际价值的,是()A. 时间复杂度下界B. 时间复杂度上界C. 时间复杂度均值
题目2单选题
计算T(n) T(n) = 4, 当n=1T(n) = T(n-1)+4, 其它A. nB. 2nC. 4nD. 8n
题目3单选题
计算T(n) T(n) = 1, n=1 T(n) = T(n-1) +n, 其它A. <img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp">B. n(n+1)/2C. nD. n(n+1)
题目4单选题
计算T(n) T(n) = 1, n=0 T(n) = 2T(n-1) , 其它A. n(n+1)/2B. 2nC. <img src="https://tihai-oss-cloud.itihey.com/img/6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp">D. <img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp">
题目5单选题
计算T(n) T(n) = 1, n=0 T(n) = 2T(n-1) +<img src="https://tihai-oss-cloud.itihey.com/img/6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp">, 其它A. <img src="https://tihai-oss-cloud.itihey.com/img/ec0abaa66adfefec54c656e7c2a0c695.webp">B. <img src="https://tihai-oss-cloud.itihey.com/img/ec0abaa66adfefec54c656e7c2a0c695.webp">-1C. <img src="https://tihai-oss-cloud.itihey.com/img/6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp">+1
题目6单选题
设S是一组n条直线,其中没有两条是平行的,也没有三条在同一点相交.可以用数学归纳法证明S中的直线确定了()个交点A. Θ(n)B. Θ(<img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp">)C. Θ(<img src="https://tihai-oss-cloud.itihey.com/img/f35140365daa1c7f03504cf8da491be0.webp">)D. Θ(n(n-1))
题目7单选题
给出算法的时间复杂性 Loop(n): p ← 0 for i ← 0 to 2n do p ← p*iA. O(n)B. O(<img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp">)C. Ο(<img src="https://tihai-oss-cloud.itihey.com/img/6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp">)D. O(<img src="https://tihai-oss-cloud.itihey.com/img/4da8094339c9d29ef77e83022046638d.webp">)
题目8单选题
给出算法的时间复杂性 Loop(n): p ← 0 for i ← 0 to <img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp"> do p ← p*iA. O(n)B. O(<img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp">)C. O(<img src="https://tihai-oss-cloud.itihey.com/img/4da8094339c9d29ef77e83022046638d.webp">)D. O(<img src="https://tihai-oss-cloud.itihey.com/img/6d12a9cdf0cb8e3ea2d5a2746f5060bb.webp">)
题目9单选题
给出算法的时间复杂性 Loop(n): s ← 0 for i ← 0 to <img src="https://tihai-oss-cloud.itihey.com/img/cdfe18a787f54dd9692e470c42a1a949.webp"> do for j← 1 to i do s ← s+iA. O(n)B. O(<img src="https://tihai-oss-cloud.itihey.com/img/2815196056c8a054360d9b1c86374fd5.webp">)C. O(<img src="https://tihai-oss-cloud.itihey.com/img/f35140365daa1c7f03504cf8da491be0.webp">)D. O(<img src="https://tihai-oss-cloud.itihey.com/img/4da8094339c9d29ef77e83022046638d.webp">)
题目10单选题
T(n)=T(n/3)+T(2n/3)+nA. O(logn)B. O(log3/2n)C. O(log2/3n)D. O(log(2/3)n)
下载 题海APP
拍照搜题更快捷
- 海量题库
- 无搜索限制
- 快捷拍照搜题
