Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.
Difficulty: Medium
About this MCQ
This Medium Algorithms MCQ checks one syllabus fact.
The question is: “Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.”
The accepted answer is C. Merge sort. “Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.” is answered by Merge sort (option C). Option A (“Time complexity”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge sort. Option B (“Greedy algorithm”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge sort. Remaining alternatives (Breadth-first search (BFS)) 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. Time complexity
Why not A: “Time complexity” is not correct. The accepted answer is C. Merge sort. “Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.” is answered by Merge sort (option C). O
- B. Greedy algorithm
Why not B: “Greedy algorithm” is not correct. The accepted answer is C. Merge sort. “Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.” is answered by Merge sort (option C). O
- C. Merge sort ✓
- D. Breadth-first search (BFS)
Why not D: “Breadth-first search (BFS)” is not correct. The accepted answer is C. Merge sort. “Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.” is answered by Merge sort (option C). O
Correct answer
C. Merge sort
Explanation
“Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.” is answered by Merge sort (option C). Option A (“Time complexity”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge sort. Option B (“Greedy algorithm”) does not match the stem; it is a near-miss used to catch incomplete recall of Merge sort. Remaining alternatives (Breadth-first search (BFS)) 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 Official Reference Guide
Tags: computer science, algorithms, problem solving, complexity analysis
Submitted by: MCQsHub Editorial
Related MCQs
- What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wro...
- A divide-and-conquer sorting algorithm that partitions elements around a pivot value. What is this concept cal...
- What does Binary search refer to?
- Choose the correct description of Quick sort.
- Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target valu...
- Which of the following best names the concept in which an algorithmic technique that solves problems by breaki...