Algorithms
If an algorithm has a time complexity of O(log n), what happens to the execution time when the input size doubles?
Overview
Added
March 17, 2026
Subject & domain
computer-science-fundamentals · theory-of-computation
Grade range
Grade 9 (Freshman)–Grade 12 (Senior)
Page kind
Article
Keywords
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
Introduction
No substantive main content could be extracted.
Community reviews
No published reviews yet. Be the first to share your experience.