This repository comprises the exercises done within the course unit Algorithm Analysis and Design.
Each directory represents an exercise sheet, that is, a set of proposed exercises to do within a week.
- Exercise sheet 1 - dynamic programming;
- Exercise sheet 2 - greedy and backtracking algorithms;
- Exercise sheet 3 - divide and conquer algorithms;
- Exercise sheet 4 - deep-first search, breadth-first search and topological sorting;
- Exercise sheet 5 - shortest path (Dijkstra);
- Exercise sheet 6 - graph viewer API;
- Exercise sheet 7 - minimum spanning tree;
- Exercise sheet 8 - maximum flow in transport networks.
This repository contains the C++ files for the exercises solved during the course unit. Note that some of them might contain errors and should not be used as a solution.