1 / 68

Algorithm Families: A Partial List and Examples

This article provides an overview of various algorithm families, including greedy algorithms, backtracking, approximation algorithms, divide and conquer, optimization problems, dynamic programming, linear programming, genetic algorithms, and simulated annealing. It also includes examples and announcements related to N-Queens, Hamiltonian Cycle, maze generation, making change, and Floyd's Shortest Path Algorithm.

bgregory
Download Presentation

Algorithm Families: A Partial List and Examples

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Topic 14 Algorithm Families

  2. A Partial List • Greedy Algorithms • Backtracking • Approximation Algorithms • Divide and Conquer • Families in Optimization Problems • Dynamic programming • Linear programming • Genetic Algorithms • Simulated annealing

  3. Backtracking

  4. N-Queens

  5. Hamiltonian Cycle

  6. Announcements • Participation is due

  7. Maze Generation

  8. Approximation Algorithms

  9. Divide and Conquer

  10. Randomized Algorithms

  11. Greedy Algorithms • Characteristics • Sets • Functions

  12. Examples

  13. Making Change

  14. Announcements • Homework 7 due • Will go over tomorrow • Homework 8 will be out soon • Reminder: Final is on Wednesday from 9-11

  15. Optimization problems • Dynamic programming • Linear programming • Genetic algorithms • Simulated annealing

  16. Dynamic Programming

  17. Total number of paths

  18. Paths in 2x2

  19. Paths in 4x4?

  20. Base Cases

  21. Recursive

  22. Computing 4x4

  23. Floyd’s Shortest Path Algorithm

  24. A0

  25. A1

  26. A2

  27. A3

  28. A4

  29. A5

  30. A6

  31. Pseudocode

  32. Announcements • Homework 8 up • Participation 7 up

More Related