GATE DA concept:insertion-sort PYQs & Answers

Questions 1–2 of 2. Imported answers require independent review unless marked reviewed.

Consider the problem of sorting the given array in ascending order:

P = [1, 2, 3, 5, 4]

Consider two sorting algorithms Bubble Sort (BS) and Insertion Sort (IS).

Let N1 be the total number of comparisons done by BS on the elements of P and N2 be the total number of comparisons done by IS on the elements of P.

Which of the following options is/are correct?

Your answerSelect all correct options. You can choose more than one.

N1 = 10, N2 = 4

N1 > N2

IS on P will perform only one swap

Both BS and IS on P will make at least one unnecessary comparison (i.e., comparing elements that are already in correct order)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following sorting algorithms:

(i) Bubble sort (ii) Insertion sort (iii) Selection sort

Which ONE among the following choices of sorting algorithms sorts the numbers in the array [4,3,2,1,5] in increasing order after exactly two passes over the array?

Your answerChoose one option.

(i) only

(iii) only

(i) and (ii) only

(ii) and (iii) only

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE DA concept:insertion-sort PYQs

How to practice concept:insertion-sort

Question 49

Question 45