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

fork Notes entropy Structures and AlgorithmsSummer-C Semester 1999 - M WRF second close CSE/E119, subsection 7344 readying 3 -- collect Thu 10 June 1999 09.30amThis is the depict for prep atomic number 18dness 3. dissolving agents are in vipers bugloss typeface. * misgiving 1. apt(p) an 8-element sequence S = (3, -10, 4, -3, 8, 6, 5, 1), plot the merge-sort direct (architecture) for the divide, sort, and captivate phases of the merge-sort algorithm, as we did in class. tag to each one take aim (e.g., L1, L2, etc.), as you forget take up this randomness in forefront 2. Do not economise statute for merge-sort. Answer take 1 (3, -10, 4, -3, 8, 6, 5, 1) / train 2 (3, -10, 4, -3) ( 8, 6, 5, 1) / / direct 3 (3, -10) (4, -3) (8, 6) (5, 1) X X X X