Question

Implement MERGE-SORT() algorithm that reads from a file named “inputHW02.txt” a list of double numbers (max = 3,000,000 numbers), sorts those numbers and indicates time consumption. This programming question will address the advantage of using iteration loops over recursive calls as well as using INSERTION-SORT() as a procedure in MERGESORT(). Your program must perform the following actions: 1. Opens the given file name and reads all double numbers. For simplicity, we assume this file only contains numbers and nothing else. 2. Implements the function INSERTION-SORT() that only sort an array of maximum 25 numbers. The idea is that INSERTION-SORT() will be used as a sub-procedure to sort any sub-array when its size is small enough. 3. Four versions of MERGE-SORT() namely a. MERGE-SORT-A(): Using recursive calls and NO INSERTION-SORT() as a sub-procedure b. MERGE-SORT-B(): Using ITERATIVE loops (i.e, NO recursion) and NO INSERTION-SORT() as a subprocedure. c. MERGE-SORT-C(): Using recursive calls and INSERTION-SORT() as a sub-procedure. d. MERGE-SORT-D(): Using ITERATIVE loops (i.e, NO recursion) and INSERTION-SORT() as a subprocedure. 4. For testing purpose, write another procedure to randomly generate N numbers and write them to a given file name filename where N and filename are input parameters. Report your MERGE-SORT() time consumption on the following input sizes: N = 1M, 1.5M, 2M, 2.5M and 3M numbers. That is, for each input size N, calls step 4 to generate N numbers and write them to the given file name (e.g., “inputHW02.txt”). Then reads from that file and performs MERGE-SORT-A(), MERGE-SORT-B(), MERGE-SORT-C(), MERGE-SORT-D() and report each of their time consumptions in a graph.

Answer 1

41 soltrtlon; iven data . Scanher /CJas mege Sort */ pub lic class Meae SLxt /morge sot function / public stattc void sarl (int ]0. high-low H(NL etun int Nid- 10W fN/2; / -<cccuwsively sart Sar (a low mid Sart a, mid

tu METE Sated cutrerys new in N] - 10 w, j- Mid AoT Cint k 0; k LI kt t) it imid 4emp [ ait+ eue (JhiGh) temp k1- a[HF cse a ari] temp a Aor rnt le 0; k LN; ktt) em p[k1 (low /main method/

public sttic void main Cetring ta Citin) system out print 'me saat /J; SCanne SCan > new SCanner Accept numter of lements/ eem. oet pint In ( enter number of ege eluments J scan ney nd O elements/ Cecle ayay of n a new itno /Accept lements/ Sdem gut ot 'n enderedes indego elemend: fLh it+) for Cr-0

CTYI scan. nezl [n (); sard CarY 6.n syelem. cut ptt In C" 1nelemants Ci= D in + t) Por prind Cau ]+" '); ystem ocet Prio4 In ) ins ention sor publtc class inseation cord examples put lic Hatc void insentionsort (n anay 1f

5 fot key (array ikef while (cr arry it]aray']] pubitc stadic void main (string ar] f a, t, 3,2, 3,,56.22 Syslem out Ps int In ("Betore ineion sor7: em ou print Ci

insention sor CorI): // sortin insertion sar Sstem olet print In ("aflen insertion st Sem out prind (tt"") 6