Notes

Handouts

Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015
  1. Preliminaries
  2. Analysis
  3. Divide and Conquer
  4. Greedy
  5. DynamicProgramming
  6. Knapsack
  7. LCS
  8. Telescope Scheduling
  9. Mergesort
  10. Quicksort
  11. SortingLowerBound
  12. RadixSort
  13. Selection
  14. Graphs
  15. DFS
  16. BFS
  17. Digraphs
  18. Biconnectivity
  19. Shortest Paths
  20. MSTs
  21. NPComplete
  22. NPComplete2
  23. Approximation
  24. Crpyptography
  25. Numerical algorithms
  26. RSA Cryptosystem
  27. Fast Fourier Transform
  28. Heaps
Computer Science Department University of Crete