The Algorithm Visualiser is a web-based application that visually represents various algorithms, including sorting algorithms and famous algorithms like the Sieve of Eratosthenes and N-Queen problem. This project aims to make understanding algorithms more accessible and engaging through dynamic visualizations.
- Visualizes popular sorting algorithms such as:
- Bubble Sort
- Merge Sort
- Quick Sort
- Selection Sort
- Implements the Sieve of Eratosthenes for prime number generation.
- Showcases the N-Queen algorithm solutions.
- Intuitive and interactive user interface built with React.js.
- Allows users to customize input sizes and algorithm speeds.
- Clone the repository:
git clone https://github.com/adityapandeji/ShamelessFerret.git
- Navigate into the project directory:
cd ShamelessFerret
- Install dependencies:
npm install
- Start the development server:
npm run start
Usage
Once the development server is running, open your web browser and navigate to http://localhost:3000 to access the Algorithm Visualiser. Select the algorithm you wish to visualize, input the necessary parameters, and watch the magic happen! Algorithms Included Sorting Algorithms
Bubble Sort Merge Sort Quick Sort Selection Sort
Other Algorithms
Sieve of Eratosthenes: A simple and efficient algorithm to find all prime numbers up to a specified integer. N-Queen Problem: Visual representation of the placement of N queens on an NxN chessboard so that no two queens threaten each other.
Contribution Contributions are welcome! If you have suggestions for features or improvements, please create a pull request or open an issue. License This project is licensed under the MIT License - see the LICENSE file for details. Contact For questions or feedback, feel free to reach out:
Pande Aditya - [email protected]
Enjoy exploring algorithms visually!
Feel free to adjust the project name, features, algorithms, and contact information to reflect your specifics. This template provides a structured format for presenting your project effectively on GitHub.