Not really bubblesort algorithm, closer to selection sort
Rename bubblesort to selectionsort

* Add a min_number_index variable so only one swap is performed on each
iteration through the array
Algorithm is closer to selectionsort

* Rename it before updating the algorithm fully
Implement SelectionSort

* Rename function name to selectionsort
* Define min_index variable to store the index of the minimum value in
the array on each iteration
* Swap values only once (after second level loop is finished)
Restart bubblesort implementation

* yeah, i know, it's not good...
Implement bubblesort algorithm
Define bubblesort file structure

* No algorithm implemented yet
Implement bubblesort algorithm

* Define TRUE and FALSE as 1 and 0 respectively for readability