Skip to content

Akalinismet/Algorithms-DataStructures

Repository files navigation

🧮 Algorithms & Data Structures

Language License Repo Size

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).

📂 Repository Contents

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.

🛠️ Technologies Used

  • C (64.6%): Used for performance-critical implementations and understanding pointers/memory.
  • Python (35.4%): Used for rapid prototyping and mathematical simulations.

🚀 Getting Started

To use or test these algorithms on your local machine, follow these steps:

  1. Clone the repository:

    git clone [https://github.com/Akalinismet/Algorithms-DataStructures.git](https://github.com/Akalinismet/Algorithms-DataStructures.git)
  2. Navigate to the directory:

    cd Algorithms-DataStructures
  3. Run an example (e.g., Python):

    cd Merge-Sort
    python merge_sort.py

    (Note: Replace merge_sort.py with the actual filename inside the folder)

🤝 Contributing

Contributions, issues, and feature requests are welcome!

  1. Fork the project.
  2. Create your feature branch (git checkout -b feature/AmazingFeature).
  3. Commit your changes (git commit -m 'Add some AmazingFeature').
  4. Push to the branch (git push origin feature/AmazingFeature).
  5. Open a Pull Request.

👤 Author

İsmet Akalın


If you find this repository helpful, please give it a ⭐ star!

About

A comprehensive collection of fundamental algorithms and data structures implemented in C and Python. Includes sorting algorithms, trees, and mathematical models.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors