Fundamental Algorithms WS 2008/09

Prerequisites:

Contents:

• Fundamentals
  models of computation, complexity measures, Landau notation
• Sorting
  insertion-/merge-/heap-/quick-sort
• Searching and Trees
  binary search, search trees, AVL trees, (2,3)-trees
• Heaps and Priority Queues
  
• Graph Algorithms
  depth first search, breath first search, shortest path problems, minimum spanning trees
• Arithmetic Problems
  euclidean algorithm, multiplication of integers

Literature:

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.: Introduction to Algorithms, 2nd Print, MIT Press, 2001
• Robert Sedgewick.: Algorithms, 2nd Print, Pearson Education, Munich, 2002
• Volker Heun: Grundlegende Algorithmen, 2. Auflage, Vieweg-Verlag, 2003