Question 1
What is the main advantage of using the divide-and-conquer approach in algorithms?
Question 2
In the divide-and-conquer paradigm, what is the purpose of the 'divide' step?
Question 3
Which of the following best describes the 'combine' step in a divide-and-conquer algorithm?
Question 4
What is the time complexity of the quicksort algorithm in the average case?
Question 5
Which of the following algorithms uses the divide-and-conquer strategy?
