Top MCQs on SelectionSort Algorithm with Answers

Last Updated :
Discuss
Comments

Question 1

Which of the following sorting algorithms has the lowest worst-case complexity?

  • Merge Sort

  • Bubble Sort

  • Quick Sort

  • Selection Sort

Discuss it

Question 2

Which one of the following in-place sorting algorithms needs the minimum number of swaps?
  • Insertion Sort
  • Quick Sort
  • Heap Sort
  • Selection Sort
Discuss it

Question 3

How many comparisons are needed to sort an array of length 5 if a straight selection sort is used and array is already in the opposite order?
  • 1
  • 5
  • 10
  • 20
Discuss it

Question 4

Which is the correct order of the following algorithms with respect to their time Complexity in the best case ?
  • Merge sort > Quick sort >Insertion sort > selection sort
  • insertion sort < Quick sort < Merge sort < selection sort
  • Merge sort > selection sort > quick sort > insertion sort
  • Merge sort > Quick sort > selection sort > insertion sort
Discuss it

Question 5

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.

  • Insertion Sort

  • Heap Sort

  • Merge Sort

  • Selection Sort

Discuss it

Question 6

Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general?

  • Heap Sort

  • Selection Sort

  • Insertion Sort

  • Merge Sort

Discuss it

There are 6 questions to complete.

Take a part in the ongoing discussion