Unformatted text preview: recurrence equation. The pseudocode for bubble sort is as follows: bubblesort(A, p, r) // p: starting index; r: ending index 1. if p < r 2. for i < p to r1 3. do if A[i] > A[i+1] 4. then exchange A[i] <> A[i+1]; 5. bubblesort(A, p, r1) 3. (15 points) Problem 21 parts a, b, c on page 39 of the textbook. 4. (10 points) Please use the basic deFnition of Θ notation to show 1 5 n 22 n100 = Θ( n 2 ). 5. (10 points) Exercise 3.14 on page 53 of the book. 6. (15 points) Problem 32 on page 61 of the book. 1...
View
Full Document
 Fall '09
 HawYehs
 Algorithms, Data Structures, Bubble Sort, running time, constant time, bubble sort algorithm

Click to edit the document details