M1 Media Programming

Website of Prof. Dr. Barne Kleinen, Professor for Media Informatics (Bachelor/Master) at HTW Berlin

Assignment 04 - One Algorithm

Pick an algorithm that you don’t know yet from the back part of an algorithm textbook, learn it, write a brief summary containing some sort of diagram and create an implementation.

If you find an application from within a project or other course you’re working on, the better!

Algorithm Textbooks

  • Cormen, T.H. et al. (2009) Introduction to Algorithms, Third Edition. 3rd edn. The MIT Press.
  • Roughgarden, T. (2017) Algorithms Illuminated: Part 1: The Basics. Illustrated edition. San Francisco, CA: Soundlikeyourself Publishing.
  • Roughgarden, T. (2018) Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures. 1st edition. San Francisco, CA: Soundlikeyourself Publishing, LLC.
  • Roughgarden, T. (2019) Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming. Illustrated edition. San Francisco, CA: Soundlikeyourself Publishing, LLC.
  • Roughgarden, T. (2020) Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems. New York, NY: Soundlikeyourself Publishing, LLC.
  • Roughgarden, T. (2022) Algorithms Illuminated: Omnibus Edition. New York, N.Y: Cambridge University Pr.
  • Sedgewick, R. and Wayne, K. (2011) Algorithms. 4th edn. Addison-Wesley Professional.
  • Sedgewick, R. and Wayne, K. (no date) Companion Webpage for Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne. Available at: https://algs4.cs.princeton.edu/home/ (Accessed: 20 March 2020).