Computer Science · Sorting Algorithms
An array of 7 elements, all distinct, is nearly sorted and requires only one element to be moved to complete the sorting using insertion sort. What is the maximum number of comparisons needed?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 17
- 212
- 36✓
- 41
Correct answer
6
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 Sorting Algorithms MCQs →Want more practice questions on Sorting Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Sorting Algorithms