Question

true or false: mergesort divides a given array into equal halves, which are then divided again until the subarrays are of size one and sorted. true false

Explanation:

Merge sort is a divide - and - conquer algorithm. It divides the input array into two halves, recursively sorts each half, and then merges the sorted halves. The process of dividing continues until the sub - arrays are of size one (base case for the recursion).

Answer:

True