Computer Science · Algorithms
In the 'decrease by a constant amount' approach, the problem size is reduced by a constant amount in each step (e.g., by 1 in insertion sort). What is the worst-case time complexity of the insertion sort algorithm which follows this approach?
- 1O(log n)
- 2O(1)
- 3O(n2)✓
- 4O(n)
Correct answer
O(n2)
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms