How do I implement merge sort for a two-dimensional array. In case of odd dimension, the first division contains more number of elements than the second one. The complete execution of merge sort arranges the elements in increasing order either moving row-wise or column-wise.
Link to the question: https://www.chegg.com/homework-help/questions-and-answers/implement-merge-sort-two-dimensional-array-case-odd-dimension-first-division-contains-numb-q78141749