Welcome to the Algorithms & Data Structures repository! 🚀
This project serves as a personal archive and educational resource containing implementations of fundamental computer science algorithms and data structures. The code explores core concepts using both C (for low-level memory management understanding) and Python (for high-level logic implementation).
Here is an overview of the implementations available in this repository:
| Directory | Type | Description |
|---|---|---|
Binary-Search-Tree |
Data Structure | Implementation of BST operations (insertion, deletion, traversal). |
Euclidean-Distance |
Math/Algorithm | Calculation of the straight-line distance between two points in a space. |
Insertion-Sort |
Sorting | A simple sorting algorithm that builds the final sorted array one item at a time. |
Merge-Sort |
Sorting | An efficient, stable, divide-and-conquer sorting algorithm. |
Logistic-Map-Bifurcation |
Chaos Theory | Implementation of the logistic map equation to demonstrate chaotic behavior and bifurcation diagrams. |
- C (64.6%): Used for performance-critical implementations and understanding pointers/memory.
- Python (35.4%): Used for rapid prototyping and mathematical simulations.
To use or test these algorithms on your local machine, follow these steps:
-
Clone the repository:
git clone [https://github.com/Akalinismet/Algorithms-DataStructures.git](https://github.com/Akalinismet/Algorithms-DataStructures.git)
-
Navigate to the directory:
cd Algorithms-DataStructures -
Run an example (e.g., Python):
cd Merge-Sort python merge_sort.py(Note: Replace
merge_sort.pywith the actual filename inside the folder)
Contributions, issues, and feature requests are welcome!
- Fork the project.
- Create your feature branch (
git checkout -b feature/AmazingFeature). - Commit your changes (
git commit -m 'Add some AmazingFeature'). - Push to the branch (
git push origin feature/AmazingFeature). - Open a Pull Request.
İsmet Akalın
- GitHub: @Akalinismet
If you find this repository helpful, please give it a ⭐ star!