ADM-Homework_4 - group 19

Authors:

Onur Copur
Julia Nawaro
Daniele Trappolini

Homework objective

The aim of this homework was to write some important algorithms by ourselves. The homework is divided into four exercises:

1. Hashing task! where we had to implement hash function and use Bloom Filter
2. Alphabetical Sort which required implementation of Counting Sort algorithm
3. Find similar wines! where we used k-means clustering algorithm
4. K-means can go wrong! which was the theoretical question

Repository structure

1. MAIN.ipnyb - the file contains commented code solving questions 1-3
2. Theoretical Explanation.pdf - a pdf file with written explanation for question 4
3. .png and .jpg files used for Theoretical Explanation