APA README file

Assignment 1

Assignment 2

Times from different inputs:

• input1.txt: 0.220s
• input2.txt: 0.469s
• input3.txt: 26.625s
• input4.txt: 58m 39.667s
• input5.txt: idk, but i expect that one day

For the input5.txt, what I will do is change the data structure, in somewhat that allows me to work with indexes, and then, insert the 1M elements using a dicotomic search, to locate their position.

Assignment 3

1. Implemented in hanoi.py
2. Implemented in tree_levels.py
3. Done in paper
4. Not done
5. Problem 6.31 implemented in interoven.py
6. Las Vegas always gives correct answer or fails and its probably fast meanwhile Monte Carlo gives probably correct results and it's fast. An example of a Las Vegas algorithm is Quicksort and an example of a Monte Carlo algorithm is Gillespie algorithm used in stochastic modeling.
7. Results in order:
   • [0,0,0]
   • [1,2,1,2,1,2]
   • 6
   • (2,1,2,1,2,1)
   • None
   • ('a', 1)
   • [1, 4]

License

All code is open-source software licensed under the GNU GLPv3.