Question #1. Specifically A&B.

If it helps I can make another question post.  

Homework 1 CSc 4520/6520 Design and Analysis of Algorithms Summer 2019 Due: 11:59 pm, June 22, 2019 1. An integer matrix is an n x m array of integers; for example: 10 4 -18 1 1012 -12 101 67 -23 3 10 A rou is a series of numbers from left to right and a column is the series from top to bottom. Here, we will modify merge sort to sort the rows of a matrix, with respect to their columns. For the above example, this yields: 1 1012 18 -12 101 A 3 10 4 10 5 -23 67 (a) (15 pts) Write pseudocode for this modified version of merge sort (call it MATRIXMERGESORT (b) (20 pts) Prove the best- and worst-case complexity of MATRIXMERGE- SORT. For simplicity, assume that the matrices are square (i.e they are x n matrices, in which the number of rows is equal to the number of columns) (c) (5 pts) Assume that comparing two rows can be done in constant time ((1)) Is the worst-case complexity of MATRIXMERGE or worse than regular merge sort? Why? SORT in this case better 1