Sorting Algorithm Visualizer

C# WinForms application designed to visualize and compare various sorting algorithms. The application provides an interactive interface to observe how different sorting algorithms operate on datasets of varying sizes. It supports the visualization of Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Heap Sort, Radix Sort, and Shell Sort on datasets of 10, 25, 50, and 100 elements.

---

Installation

1. Clone the repository
2. Open the project in Visual Studio 2022
3. Build and run

Usage

1. Launch the application.
2. Select a sorting algorithm from the dropdown menu (e.g., Bubble Sort, Quick Sort, etc.).
3. Choose a dataset size (10, 25, 50, or 100 elements).
4. Click "Start Visualization" to begin the sorting process.
5. Observe the real-time visualization of the sorting algorithm in action.

---

Supported Sorting Algorithms

1. Bubble Sort: A simple comparison-based algorithm that repeatedly swaps adjacent elements if they are in the wrong order.
2. Selection Sort: Selects the smallest element from the unsorted portion and swaps it with the first unsorted element.
3. Insertion Sort: Builds the final sorted array one element at a time by inserting each element into its correct position.
4. Quick Sort: A divide-and-conquer algorithm that partitions the dataset and recursively sorts the sub-arrays.
5. Heap Sort: Uses a binary heap data structure to sort elements by repeatedly extracting the maximum element.
6. Radix Sort: A non-comparative sorting algorithm that sorts numbers by processing individual digits.
7. Shell Sort: An extension of Insertion Sort that allows the exchange of elements that are far apart.

---