This repository contains some of my first steps working with Go and implementing basic, advanced and graph algoristhms. I hope to increase the list during the next months so keep in touch.
- Insertion sort
- Selection sort
- Bubble sort
- Quick sort
- Merge sort
- Heap sort
- Memoization for Fibonacci
- Binary Search
- Depth first search
- Dijkstra's algorithm
- Travelling Salesman Problem: It is solved using a dynamic programming approach with O(n^2 * 2^n) time complexity. The code is capable to find the minimum cost but not the optimal path yet.
- Hanoi's towers problem
- Sudoku problem
Feel free to make any comment, pull request, code review, shared post, fork or feedback. Everything is welcome.
This project is licensed under the MIT License.
Sebastian Zapata Mardini - GitHub profile