Simple algorithms showcase developed in python
- Mergesort
- Quicksort
- Insertion sort
- Fibonacci iterative
- Fibonacci recursive
- Fibonacci using formula: Fibonacci of n = ((1+(5^1/2))^n - (1-(5^1/2))^n) / (2n * (5^1/2))
- Fibonacci using matrix exponentiation.
Instructions to run this project:
1.- First install python in case you didn't before https://www.python.org/downloads/
-
Opent the file 'numbers.sort' located into the '../Algorithms/files' folder and write the numbers you want to manipulate, usign spaces between each number.
-
Enter into to the main project folder and type in the console the next command: python index.py
-
Select an option and enjoy the output.
-- **************** Developed by Rene Mariano Sanabria ********************
