This repo contains all exercises from the "Algorithm and Data structures" course at University of Florence.
ย
The repo is structured as follow:
-
es7-Strongly-Connected-Components
Implementation and description of Strongly Connected Components - Italian
-
Implementation and description of Edit distance and n-gram mechanisms - Italian
-
es5-Binary-Search-and-Red-Black-Tree
Implementation, description and comparison of Binary Search Tree and Red Black Tree - Italian
-
Implementation and description of Hashmap and collision resolution mechanisms - Italian
-
Implementation and comparison of Insertion- and Merge-sort algorithms - Italian
-
es2-Insertion-sort-and-Binary-search
Implementation of Insertion Sort and Binary Search Algorithms - Italian
-
Description of Insertion Sort Algorithm - Italian