Question

in merge sort The devide
.
step simply​

Answer 1

Explanation:

1. Divide by finding the number q of the position midway between p and r. ...

2. Conquer by recursively sorting the subarrays in each of the two subproblems created by the divide step. ...

3.

Combine by merging the two sorted subarrays back into the single sorted subarray array