🌈个人主页: Aileen_0v0
🔥系列专栏:<<Python数据结构与算法专栏>>
💫个人格言:"没有罗马,那就自己创造罗马~"
时间复杂度大小比较
1.time complexity of algorithm A is O(n^3) while algorithm B is O(2^n). Which of the following statement is TRUE?
A.For any problem in any scale, the alogorithm A is more efficient than alogrithm B.
B.For any problem in any scale, the alogorithm B is more efficient than alogrithm A.
C.As the scale of the proble increase,the alogrithm A is more efficient than alogrithm B.
D.As the scale of the proble increase,the alogrithm B is more efficient than alogrithm A.
文章来源：https://www.toymoban.com/news/detail-752362.html
👉Review Link文章来源地址https://www.toymoban.com/news/detail-752362.html
到了这里，关于【Python数据结构与算法】——(线性结构)精选好题分享,不挂科必看系列的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！
