Question

We have discussed divide and conquer as a problem solving technique that has three processes: Divide, conquer, and combine. Identify Divide, conquer, and combine steps of the merge sort and quick sort.

Answer 1

merge sort

divide step: In divide step of merge we divide the array into smaller subarray until we left with one element

conquer step: in this step of merge we start comparing smaller subarray element to arrange them in sorted order

combine step: in this step we merge the sorted subarray such that resulting array is sorted

quick sort

divide step:in quick sort we divide the array using a pivot in which each element left to pivot is smaller than pivot and each element right of pivot greater that pivot

conquer step: in this we sort the subarrays recursively

combine step: in this step we combine the sorted subarrays