6_split_Introduction to Algorithms 2nd Edition

6_split_Introduction to Algorithms 2nd Edition - 67 4.3 The...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Contents Preface xiii I Foundations Introduction 3 1 The Role of Algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology 10 2 Getting Started 15 2.1 Insertion sort 15 2.2 Analyzing algorithms 21 2.3 Designing algorithms 27 3 Growth of Functions 41 3.1 Asymptotic notation 41 3.2 Standard notations and common functions 51 4 Recurrences 62 4.1 The substitution method 63 4.2 The recursion-tree method
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 67 4.3 The master method 73 ± 4. 4 Proof of the master theorem 76 5 Probabilistic Analysis and Randomized Algorithms 91 5.1 The hiring problem 91 5.2 Indicator random variables 94 5.3 Randomized algorithms 99 ± 5.4 Probabilistic analysis and further uses of indicator random variables 10 6...
View Full Document

This document was uploaded on 11/22/2010.

Ask a homework question - tutors are online