running_time_analysis

running_time_analysis - COMP 271H Design and Analysis of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
COMP 271H Design and Analysis of Algorithms 2006 Fall Semester Reference material 1 1. Introduction: This article focuses on the comparsions among three fundamental methods which are commonly used in running time analysis. We use a simple recurrence equation to illustrate the idea. We list out the pros and cons of using different methods, and finally conclude the best method we should use in our exam-type questions. 2. Comparsions among three fundamental methods: In general, there are three fundamental methods for solving recurrences. All three meth- ods are listed in our textbook, chapter 4.1 to 4.3. They are: (a) The substitution method (b) The recurison-tree method (c) The master method We will use a simple recurrence equation, which is similar to merge-sort running time analysis. The recurrence equation is as follow: T(1) = 1 T( n ) = 2 T( n 2 ) + n Method 1: The subsitution method Let n = 2 k , k = log n , we have T(1) = 1 T(2 k ) = 2 T(2 k - 1 ) + 2 k Let G ( k ) = T (2 k ), we have
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.

Page1 / 2

running_time_analysis - COMP 271H Design and Analysis of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online