A repository for simple algorithms in Python. Just learning and practicing some of these things.
- Bubble Sort
- Quick Sort
- Binary Search
The following three are almost identical. These are implemented as searches for a specific target and not as graph traversals.
- Dijkstra's
- Greedy Search
- A*
These are very similar, only the initial action and update rules really differ. Both use e-greedy for exploration.
- Tabular Q-Learning: Frozen Lake environment from Gymnasium
- Tabular SARSA: Frozen Lake environment from Gymnasium
Updated the q-learning with Double Q-learning and UCB exploration.
- Double Q-Learning: Frozen Lake environment from Gymnasium