+1 vote
in Data Structures & Algorithms II by (110k points)
Which of the following algorithm implementations is similar to that of an insertion sort?

(a) Binary heap

(b) Quick sort

(c) Merge sort

(d) Radix sort

I had been asked this question in an online interview.

Asked question is from Insertion sort topic in chapter Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Correct option is (a) Binary heap

The explanation is: Insertion sort is similar to that of a binary heap algorithm because of the use of temporary variable to swap.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.