This repository contains Python implementations of algorithms and exercises from the "Grokking Algorithms" book by Aditya Bhargava. Each algorithm is accompanied by a set of test cases to ensure its correctness.
The "Grokking Algorithms" book is a fantastic resource for understanding fundamental algorithms and data structures. This repository aims to provide Python implementations for the algorithms covered in the book, along with corresponding tests.
Feel free to use this code as a reference while reading the book or as a supplement to your algorithmic studies. Contributions and improvements are welcome!
To get started with the code in this repository, follow these steps:
- Clone the repository to your local machine:
git clone https://github.com/ayo-awe/grokking-algorithms.git- Navigate to the project directory:
cd grokking-algorithms-pythonThe following algorithms and exercises from the book are implemented in this repository:
- Binary Search
- Selection Sort
- Recursive Max
- Recursive Len
Each algorithm has its own dedicated Python file in the algorithms directory.
Tests are included for each algorithm to verify their correctness. To run the tests, use the following command:
python -m unittest discover testsThis command will discover and run all tests in the tests directory.
Contributions are highly encouraged! If you find any issues, have suggestions for improvements, or want to add new algorithms, please open an issue or submit a pull request. Make sure to follow the existing code style and include relevant test cases.