lecture13AlgDesign1 - Recursive breakdown of problem Saving...

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

View Full Document Right Arrow Icon
Algorithm Design Techniques (Chapter 10)  Overview of a large area
Background image of page 1

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

View Full DocumentRight Arrow Icon
General types of algorithms Greedy algorithms Divide and conquer Dynamic programming Randomized algorithms Backtracking algorithms
Background image of page 2
Greedy algorithms Make the best choice at each phase May or may not get a global optimum Dijkstra’s algorithm and Kruskal’s  algorithm do produce globally optimal  results. Some change making algorithms and  some scheduling algorithms do also.
Background image of page 3

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

View Full DocumentRight Arrow Icon
Divide and conquer Divide larger problem into smaller  problems, perhaps recursively. Solve (conquer) the smaller problems  and construct the solution to the larger  one. Binary search, quicksort, matrix  multiplication
Background image of page 4
Dynamic programming
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Recursive breakdown of problem Saving a table of intermediate results so that they need not be recomputed Ordering matrix multiplications All pairs shortest paths in graph Viterbi algorithm for error correction Randomized algorithms Use random number generation to make decision, avoid bad case. Skip lists Hashing? Backtracking Going forward with choices (perhaps in a greedy manner) but backing up to remake choices later on Can have smart heuristics to stop going forward and to prune a search tree Game playing Graph search See separate slides On different algorithm design techniques...
View Full Document

This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.

Page1 / 8

lecture13AlgDesign1 - Recursive breakdown of problem Saving...

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

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