AOA Algorithm Visualization

This project is a visualization website for various algorithms based on different approaches in the field of Analysis of Algorithms (AOA). It is created using HTML, CSS, JavaScript, and Bootstrap.

Algorithms and Approaches

Greedy Approach

• Dijkstra Algorithm
• Fractional Knapsack Algorithm

Backtracking Approach

• N-Queen Algorithm

Dynamic Programming Approach

• 0/1 Knapsack Algorithm

Divide & Conquer Approach

• Merge Sort Algorithm
• Quick Sort Algorithm

How to Use

• Clone the repository.
• Open the index.html file in your browser.
• Select an algorithm and approach.
• Click the "Run Algorithm" button to see the algorithm in action.

Contributing

Contributions are welcome! If you would like to contribute to this project, please follow these steps:

1. Fork the repository.
2. Create a new branch (git checkout -b feature/your-branch-name).
3. Make your changes.
4. Commit your changes (git commit -am 'Add your message here').
5. Push to the branch (git push origin feature/your-branch-name).
6. Create a new Pull Request.