This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: .. T(2)T(0) = log(2) The sum of all of these equations is T(n) T(0) = log(n) + log(n2)++log(2) //using telescopic summation T(n) T(0)=log(n*(n2)*(n4). .) Assume that T(0) is constant, therefore T(n) =O( log(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