Part Two - Stanford University
Divide-and-Conquer Algorithms
Part Two
Recap from Last Time
Divide-and-Conquer Algorithms
A divide-and-conquer algorithm is one that works as follows:
(Divide) Split the input apart into multiple smaller pieces, then recursively invoke the algorithm on those pieces.
(Conquer) Combine those solutions back together to form the overall answer.
Can be analyzed using recurrence relations.
Two Important Recurrences
TT((00))==((11)) TT((11))==((11)) TT((nn))==TT((nn//22))++TT((nn//22))++((nn))
Solves to O(n log n)
TT((00))==((11)) TT((11))==((11)) TT((nn))TT((nn//22))++((11))
Solves to O(log n)
Outline for Today
More Recurrences
Other divide-and-conquer relations.
Algorithmic Lower Bounds
Showing that certain problems cannot be solved within certain limits.
Binary Heaps
A fast data structure for retrieving elements in sorted order.
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- list — list values of variables
- how to read a value line report
- marketingmarketing indexindex numbersnumbers
- vlookup lookup value table array col index num range
- list processing in sml wellesley college
- glycemic index and glycemic load for 100 foods
- part two stanford university
- purine table and information
- measuring evaluation results with microsoft excel
- pka values index organic chemistry data
Related searches
- stanford university philosophy department
- stanford university plato
- stanford university encyclopedia of philosophy
- stanford university philosophy encyclopedia
- stanford university philosophy
- stanford university ein number
- stanford university master computer science
- stanford university graduate programs
- stanford university computer science ms
- stanford university phd programs
- stanford university phd in education
- stanford university online doctoral programs