Question

4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up to n, anda number num which we wish to insert into A, in the proper sorted position. The function Search finds the minimum index i such that num should be inserted into Ali]. It searches the array sequentially until it finds the location i. Another function MakeRoom moves A[i], .., AIn] to Ali+1]...AIn+1] same sort of C++ like pseudocode used in the text. Do a worst- case analysis of your algorithm, counting comparisons of num with array elements. b) [5 points] Write an algorithm for the function MakeRoom, using worst-case analysis of your algorithm, counting each time an array element is moved. If you use any sort of swap routine, this would count as 2 moves of array elements. c) [5 points] The algorithm Insert which inserts num into A consists of calling Search and then MakeRoom. Do a worst-case analysis of Insert, counting both comparisons of num with elements in A, and counting whenever an element of A is moved

Answer 1

4 int Seasch Cint fa 3

p. fot j; Pas;Search Carr, η , num): int

Examples index 4

tn worst Cose, Search oi the Dumber ib Larycst compurnisions In best Coase g all- eei moes Case moke com T)e