Algorithms
==========

# Introduction

This includes exercises from the Algorithms lecture. Well, this is just a refresh exercise.

# Testing

For unit tests run:

``make test``

# Benchmarking

For running benchmars run:

``make bench``

# TODO:

* HeapSort
* ElementarySet (linked list)
* Set with sorted linked list + Bianry Search