Algorithms
If an algorithm has a time complexity of O(log n), what happens to the execution time when the input size doubles?
概览
收录于
2026年3月17日
学科与领域
computer-science-fundamentals · theory-of-computation
年级范围
九年级（高一）–十二年级（高四）
页面类型
Article
关键词
Data Structures Algorithms Python Java C C++ JavaScript Android Development SQL Data Science Machine Learning PHP Web Development System Design Tutorial Technical Blogs Interview Experience Interview Preparation Programming Competitive Programming Jobs Coding Contests GATE CSE HTML CSS React NodeJS Placement Aptitude Quiz Computer Science Programming Examples GeeksforGeeks Courses Puzzles SSC Banking UPSC Commerce Finance CBSE School k12 General Knowledge News Mathematics Exams
简介
No substantive main content could be extracted.
用户评价
暂无已发布的评价，欢迎率先分享您的使用体验。