算法函数,算法作业,算法导论.docxVIP

1. Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in (64n lg n) steps. For which values of n does insertion sort beat merge sort? Answer: if we want the insertion sort beat the merge sort, the condition that should be satisfied with is: 8n2 64n lg n n 8 lg n 2n n8 2= n =43 So when n range from 2 to 43，the insertion sort beat the merge sort。 2. Algorithm Mystery(A: Array [i..j] of integer) if i=j then return A[i] else k=i+floor((j-i)/2) temp1= Mystery(A[i..k]) temp2= Mystery(A[(k+1)..j] if temp1temp2 then return temp1 else return temp2 What does the recursive algorithm above compute? Determine and state the two recurrence relations of this algorithm. Determine the values of constants in the recurrences by assuming that a comparison, returning a value, reading a value from an array cell, variable assignment, arithmetic operations and the floor function have a cost of 1 each. Use one of the methods discussed in class to determine the EXACT mathematical expression for T(n). Based on that expression, state the order of complexity of this algorithm. Now use a different method to solve the recurrences and show that the order of complexity you stated in (c) is right. Show details of your work if you want to get partial credit. Answer: (a) the recursive algorithm above compute the smallest integer in the A:Array[i..j](找序列里的最小值) （b）Divide and conquer algorithm. It divide the array into two parts ,each of the two parts continue divide the array into two parts ,and when it can’t be divided , it is recursive, and then ,compare the two part and get the smaller number.(分治方法，当递归时将数组分为两块来比较,递归取小的值) （c）Answer: T steps and time cost returned value calculate k function call compare T(1) 1 0 0 0 T(2) 2 1 2 2 T(3) 3 2