Welcome to the Java Sorting Algorithms repository! This project features three classic sorting algorithms implemented in Java, complemented by a graphical user interface (GUI) for visualizing the sorting process. The included algorithms are Bubble Sort, Merge Sort, and Quick Sort. This tool is perfect for educational purposes, helping users to understand the intricacies of these sorting algorithms through interactive visualizations.

This project aims to provide a hands-on understanding of sorting algorithms by visualizing their operations step-by-step. Users can select an algorithm, generate a random array, and watch the algorithm sort the array in real-time. The GUI allows for interactive learning and comparison of the sorting algorithms.

• Interactive GUI: Real-time visualization of sorting processes.
• Multiple Sorting Algorithms: Includes Bubble Sort, Merge Sort, and Quick Sort.
• Customization Options: Users can adjust the speed of visualization and the size of the array.
• Educational Tool: Ideal for students and educators to understand sorting algorithms.

Here are some screenshots of the application in action:

• Java: Core programming language used.
• Swing: For building the graphical user interface.

To get started with the application, follow these steps:

1. Clone the repository:

   git clone https://github.com/yourusername/java-sorting-algorithms.git
   cd java-sorting-algorithms

2. Open the project in your favorite IDE: Open the project folder in an IDE like IntelliJ IDEA, Eclipse, or NetBeans.

3. Run the application: Locate the main class (Main.java) and run it.

1. Select a Sorting Algorithm: Choose from Bubble Sort, Merge Sort, or Quick Sort.
2. Start Sorting: Press the "Start" button to begin the visualization.
3. Adjust Speed: Use the slider to control the speed of the visualization.

• Additional Algorithms: Implement and visualize more sorting algorithms such as Insertion Sort, Selection Sort, and Heap Sort.
• Enhanced Visualization: Add more detailed animations to illustrate key steps in the algorithms.
• User Input: Allow users to input their own arrays for sorting.
• Comparative Analysis: Provide side-by-side visual comparison of two or more sorting algorithms.

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

Thank you for checking out my project! Enjoy visualizing and learning about sorting algorithms!