Algorithms · Question 11 · Medium

Algorithms question 11

Insertion sort is applied to [5, 2, 4, 6, 1, 3]. What does the array look like after the first 2 passes (i.e. after inserting the elements at index 1 and index 2)?

  1. [2, 5, 4, 6, 1, 3]
  2. [2, 4, 5, 6, 1, 3]
  3. [1, 2, 4, 6, 5, 3]
  4. [2, 4, 5, 1, 6, 3]
Answer and explanation

Answer: B. [2, 4, 5, 6, 1, 3]

Explanation: Pass 1 inserts 2 before 5: [2, 5, 4, 6, 1, 3]. Pass 2 inserts 4 between 2 and 5: [2, 4, 5, 6, 1, 3].

Previous: Coins of value ₹1, ₹3 and ₹4 are available in unlimited supply. A greedy… · Next: What is the length of the Longest Common Subsequence (LCS) of the strings…

Practise algorithms

Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.

More algorithms questions

More technical & programming practice

Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics

LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge