GATE | CS | 2021 | Set 1 | Algorithms | Searching and Sorting | Question 19

Last Updated :
Discuss
Comments

Consider the following array.


Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort the above array in ascending order?

Selection sort

Mergesort

Insertion sort

Quicksort using the last element as pivot

This question is part of this quiz :

Top MCQs on Divide and Conquer Algorithm with Answers,GATE CS 2021 | Set 1
Tags:
DSA Quiz
GATE
Algorithms
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy