Which sorting algorithm has the best average-case time complexity among the following?

Difficulty: Medium

About this MCQ

This Medium Algorithms MCQ checks one syllabus fact.

The question is: “Which sorting algorithm has the best average-case time complexity among the following?”

The accepted answer is B. Merge Sort. Merge Sort is the person, body, or term that satisfies “Which sorting algorithm has the best average-case time complexity among the following” (option B). Option A (“Bubble Sort”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge Sort. Option C (“Insertion Sort”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge Sort. Remaining alternatives (Selection Sort) fall outside the same rule and should be eliminated once Merge Sort is identified. Algorithms questions of this type reward precise definitions rather than approximate associations. Algorithms recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.

A. Bubble Sort
Why not A: “Bubble Sort” is not correct. The accepted answer is B. Merge Sort. Merge Sort is the person, body, or term that satisfies “Which sorting algorithm has the best average-case time complexity among the following” (option B). Option A (“Bubble Sort”)
B. Merge Sort ✓
C. Insertion Sort
Why not C: “Insertion Sort” is not correct. The accepted answer is B. Merge Sort. Merge Sort is the person, body, or term that satisfies “Which sorting algorithm has the best average-case time complexity among the following” (option B). Option A (“Bubble Sort”)
D. Selection Sort
Why not D: “Selection Sort” is not correct. The accepted answer is B. Merge Sort. Merge Sort is the person, body, or term that satisfies “Which sorting algorithm has the best average-case time complexity among the following” (option B). Option A (“Bubble Sort”)

Correct answer

B. Merge Sort

Explanation

Merge Sort is the person, body, or term that satisfies “Which sorting algorithm has the best average-case time complexity among the following” (option B). Option A (“Bubble Sort”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge Sort. Option C (“Insertion Sort”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge Sort. Remaining alternatives (Selection Sort) fall outside the same rule and should be eliminated once Merge Sort is identified. Algorithms questions of this type reward precise definitions rather than approximate associations. Algorithms recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.

Source: Algorithms Reference Guide

Tags: algorithms, merge sort, time complexity

Submitted by: MCQsHub Editorial

Related MCQs

More Algorithms MCQs