What algorithmic design paradigm is employed by MergeSort and QuickSort?
Answer and explanation
Correct answer: C. Divide and conquer
- Step 1: Examine how MergeSort and QuickSort solve sorting: break problems into smaller subproblems, solve recursively, and combine answers.
- Step 2: This classic three-step sequence (Divide, Conquer, Combine) defines the divide-and-conquer paradigm.
Answer
Divide and conquer.
Why not the others: Greedy methods make locally optimal choices; dynamic programming solves overlapping subproblems via memoization; branch and bound is for optimization search trees.
Practise more Algorithms and Python Programming.
Free questions with an explanation for every one, and full timed EmSAT Achieve (UAE) mock tests.
More Algorithms and Python Programming questions
- What is the output of the following Python expression: [x**2 for x in range(6) if x % 2 != 0]?
- What is the worst-case time complexity of searching for an element in a balanced binary search tree (AVL tree) containing n nodes?
- What will be printed by the following Python code snippet?
def func(val, lst=[]):
lst.append(val)
return lst
print(func(1))
print(… - Which abstract data structure operates on a First-In, First-Out (FIFO) ordering principle?
- What is the return value of executing the recursive Python function `mystery(4)`?
def mystery(n):
if n <= 1:
return 1
retur… - What is the worst-case time complexity of the standard QuickSort algorithm when the chosen pivot is consistently the smallest or largest ele…