Unformatted text preview: x is at least 4(1/2n7 2 )>= 2n/7 – 8 Then the recurrence will be T(n) <= T(n/7) + T(5n/7 + 8) + O(n) It can be solved by substitution like the solution in the book which shows us it is linear. If we divide the elements into groups of 3, the number of elements greater than x is at least 2(1/2(n/3) 2) >= n/34 Then the recurrence will be T(n) <= T(n/3) + T(2n/3 + 4) + O(n)...
View
Full
Document
This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.
 Spring '09
 Dr.Ayman
 Algorithms

Click to edit the document details