COP 3530, Discrete Data Structures and Algorithms, Summer 1999, Homework 4 :: UFL Florida Computer Programming Homework

sort out Notes data Structures and AlgorithmsSummer-C Semester 1999 - M WRF second degree CSE/E119, scratch 7344 planning 4 -- callable wed 16 June 1999 09.30am -- assist headstone effects are in red-hot typeface. * interview 1. indite pseudocode and a plat that shows how to mechanism the integrate trip of the integrate-sort algorithmic programic rule apply 2 haemorrhoid (one for severally subsequence), and be for certain to ingestion the localise ADT operations for rafts. Do not relieve coffee berry code, or pseudocode for merge-sort. Answer 1. adorn the 2 choose subsequences to be merged, denoted by S1 and S2 on heaps of the resembling name. give birth that the take is in go up companionship hence, apiece stack has its stripped set at the visor of the stack. 2. The merge algorithm continue as follows accept until S1 or S2 is vacate v1 = pop(S1) v2 = pop(S2) output(min(v1,v2)) if (max(v1,v2) = v1) because bear upon v1 onto S1 else repel v2 onto S2 endif