This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4. Solve the following recurrences by giving an exact closed form solution for T ( n ) if possible or giving an asymptotic upper bound otherwise. (You may assume that n is a power of an integer as you need.) (a) T ( n ) = 2 T ( n/ 2) + log n, T (2) = 1. (b) T ( n ) = 16 T ( n/ 4 + 3) + n 2 , T ( k ) = 1 for k 4. 5. The input is a set S containing n real numbers, and a real number x . Design an algorithm to determine whether there are two elements of S whose sum is exactly x . The running time of your algorithm should be O ( n log n ) 1...
View Full
Document
 Spring '10
 Ray

Click to edit the document details