Computer Science · Data Structures and Algorithms
Identify the correct statement about the insertion sort algorithm: Statement-1: Insertion sort is an efficient algorithm for sorting a small number of elements and the algorithm sorts the input numbers in place. Statement-2: The worst-case and average-case running time of an insertion sort is O(n2) whereas the best-case running time is O(n).
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement-1 is True and Statement-2 is False✓
- 2Statement-1 is False and Statement-2 is False
- 3Statement-1 is False and Statement-2 is True
- 4Statement-1 is True and Statement-2 is True
Correct answer
Statement-1 is True and Statement-2 is False
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 Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms