Solved classic and novel problems in computing that require the analysis of different solutions and programming paradigms, as brute-force, divide and conquer, transform and conquer, reduce and conquer, dynamic programming and backtracking paradigms, also trees, graphs and string processing.
Backtracking:
- CD
- Eight
- Playing with Wheels
- Rat in a Maze
Greedy Algorithms
- Coin-collector
- Station Balance
Divide and Conquer:
- Inversoes
- The Playboy Chimp
- Solve It
Dynamic Programming
- Change
- Russian Nest Dolls
- Suitcase Weight
Balance:
- Stable Marriage Problem
String:
- KMP
- Edit Distance
Number Theory:
- The Factorial Function N!
- Factors and Factorials
Project for Advanced Algorithms and Applications (SCC0218) - Computer Science @ Instituto de Ciências Matemáticas e de Computação (ICMC) - Universidade de São Paulo (USP). São Carlos, Brazil, 2020.