+1 vote
in Data Structures & Algorithms II by (110k points)
Which of the following sorting algorithms is the fastest?

(a) Merge sort

(b) Quick sort

(c) Insertion sort

(d) Shell sort

The question was posed to me in class test.

The question is from Quicksort topic in portion Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Right choice is (b) Quick sort

Easiest explanation - Quick sort is the fastest known sorting algorithm because of its highly optimized inner loop.

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.

Categories

...