Start learning →

Placing each element into its correct spot among those already sorted describes:

AIndexing sort
BInsertion sort
CInversion sort
DInterval sort
Answer & Solution
Correct answer: B. Insertion sort
1. Elements already handled stay in order. 2. The next element is slotted into its right place among them. 3. That method is insertion sort. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._
Practise this question with Quill — Engineering — Tanzania →

Keep practising Sorting Algorithms

Browse all Sorting Algorithms questions for Engineering — Tanzania, or explore more Computer Science topics.

Start a Sorting Algorithms lesson →
Related questions
Sorting bingoType the numberSort the algorithm wordsBubble or selectionSlice the algorithm wordsRun the algorithm gatesPop the complexity classesCatch the sorting words