Algorizz: Sorting and Graph Algorithm Visualizer

Overview

Algorizz is a web-based application designed to visualize common sorting and graph algorithms. It provides an interactive and educational experience, allowing users to understand how these algorithms work step-by-step.

Features

• Sorting Algorithm Visualization:
  • Visualizes various sorting algorithms, including:
    • Bubble Sort
    • Insertion Sort
    • Selection Sort
    • Merge Sort
    • Quick Sort
  • Allows users to control the speed of the visualization.
  • Generates random arrays for sorting.
  • Allows users to input custom arrays.
• Graph Algorithm Visualization:
  • Visualizes graph traversal algorithms, including:
    • Depth-First Search (DFS)
    • Breadth-First Search (BFS)
    • Dijkstra's Shortest Path Algorithm.
  • Allows users to create and modify graphs.
  • Displays the steps of the algorithm in real-time.
• User-Friendly Interface:
  • Intuitive and easy-to-use interface.
  • Clear and concise visualizations.
  • Provides explanations and descriptions of the algorithms.

Getting Started

1. Clone the repository:

   git clone <repository_url>

2. Navigate to the project directory:

   cd Algorizz

Usage

• Sorting Algorithms:
  • Select the desired sorting algorithm from the dropdown menu.
  • Click the "Generate Array" button to create a random array.
  • Optionally, input your own array.
  • Adjust the speed of the visualization using the slider.
  • Click the "Start" button to begin the visualization.
• Graph Algorithms:
  • Select the desired graph algorithm from the dropdown menu.
  • Use the interface to create nodes and edges.
  • Select a starting node.
  • Click the "Start" button to visualize the algorithm.

Technologies Used

*React.js *Tailwind *C++ (for analyzing the algorithms)