Physics · Computer Science - Algorithms
Which statement correctly defines worst-case time complexity O(f(n)) according to Big-O asymptotic notation?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The algorithm takes at least f(n) time for all inputs.
- 2The algorithm takes at most c × f(n) time for all sufficiently large n, where c is a positive constant.✓
- 3The algorithm always takes exactly f(n) time.
- 4The algorithm takes at most f(n) time for all inputs.
Correct answer
The algorithm takes at most c × f(n) time for all sufficiently large n, where c is a positive constant.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Physics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Computer Science - Algorithms MCQs →Want more practice questions on Computer Science - Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Physics · Computer Science - Algorithms