Skip to content

README.md

Latest commit

 

History

History
86 lines (64 loc) · 2.2 KB

README.md

File metadata and controls

86 lines (64 loc) · 2.2 KB

Algorithm Visualizer

Build Python 3.9 License MIT

Algorithm Visualizer is an interactive and visually appealing learning tool designed to help students and enthusiasts understand and appreciate the beauty of algorithms and data structures taught in the "Algorithms and Data Structures" university course. This project not only provides the code for these algorithms but also visualizes their steps using HTML, CSS and Javascript, making learning a delightful experience. Please note that this project is currently a work in progress and some features are not yet complete.

Table of Contents

  1. Installation
  2. Usage
  3. Algorithms
  4. Data Structures
  5. Contribution
  6. License

Installation

Clone the repository to your local machine

git clone https://github.com/stian96/algorithm-visualizer.git

Navigate to the project directory:

cd algorithms-visualizer

Install the required Python libraries:

pip install -r requirements.txt

Usage

Run the main script from the command line:

python main.py

Algorithms

The project includes the following algorithms:

  1. Sorting Algorithms
    • Bubble Sort
    • Insertion Sort
    • Selection Sort
    • Quick Sort
    • Merge Sort
    • Heap Sort
  2. Searching Algorithms
    • Linear Search
    • Binary Search
    • Recurive Search
  3. Graph Algorithms (Work in Progress)
    • Depth-First Search (DFS)
    • Breadth-First Search (BFS)
    • Dijkstra's Algorithm

Data Structures

The project includes the following data structures:

  1. Array
  2. Linked List (Work in Progress)
  3. Stack
  4. Queue (Work in Progress)
  5. Binary Tree
  6. Binary Search Tree
  7. Heap (Work in Progress)
  8. Graph (Work in Progress)
  9. Hash Table (Work in Progress)

Contribution

Contributions are always welcome. Feel free to open a PR or file an issue.

License

This project is licensed under the MIT License. See the LICENSE file for more details.

Developed with ❤️ by stian96.