+1 vote
in Data Structures & Algorithms II by (110k points)
Which of the following is good for sorting arrays having less than 100 elements?

(a) Quick Sort

(b) Selection Sort

(c) Merge Sort

(d) Insertion Sort

I had been asked this question in class test.

The origin of the question is Insertion sort in portion Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Correct choice is (d) Insertion Sort

The best explanation: The insertion sort is good for sorting small arrays. It sorts smaller arrays faster than any other sorting algorithm.

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.