150.200 Efficient Algorithms and Data Structures


[Zurück zur LVA Liste] [Diese LVA in MU Online] [Übungen in MU Online]

Textbooks and Further Reading

The material of the first half of the course is covered in Algorithms (4th Edition) by Robert Sedgewick and Kevin Wayne. (The book contains much more material than what we can cover in the course.)

Animation of sorting algorithms

Exercises

Assigments

  1. Compare the runtime of MergeSort and Quicksort, depending on the time needed for the comparison. (Use the classes MergeX and QuickX from the "Algorithms" code.) [Due 18 March 2019]
  2. Aufgabenstellung Knapp Coding Contest 2016. Zeigen Sie, dass das Berechnen einer optimalen Lösung im allgemeinen NP-schwer ist. Verwenden Sie zum Beispiel eine Reduktion von PARTITION.