-
In the first exercise i compared the performance of two sorting algorithms: Insertion Sort and Quick Sort.
-
In the second exercise i compared the the performance between two structure : Binary Search Tree and Red Black Tree.
-
In the third exercise i did some experiments on the Strongly Connected Components of a graph.
For more information check the single exercise report file.