Lecture 1:a. Correctnes b. Applets c. Tables Lecture 2 a.Applets b.Tables c.Exercises Lecture 3Lecture 4a.Appletsb. ProblemsLecture 5 Lecture 6 Lecture 7 Lecture 8 Test 1 Test 2 |
Exercises
2.3-1) Using Figure 2.4 as a model, illustrate the operation of merge sort on the array A = (3, 41,
52, 26, 38, 57, 9, 49).
>>Solution
2.3-3) Use mathematical induction to show that when n is an exact power of 2, the solution of the
recurrence.
>>Solution
2.3-4) Insertion sort can be expressed as a recursive procedure as follows. In order to sort A[1... n],
we recursively sort A[1... n -1] and then insert A[n] into the sorted array A[1...n - 1]. Write a
recurrence for the running time of this recursive version of insertion sort.
>>Solution
|
