⚡ Algorithm Performance Comparator (Core Java Project)

Project Overview

This project is a GUI-based application built using Core Java (Swing) to compare the performance of different sorting algorithms.

It measures execution time, comparisons, and swaps, and visually represents results using charts and tables.

---

Technologies Used

• Java (Core Java)
• Swing (GUI Development)
• Multithreading (Concurrency)
• Collections Framework
• File Handling

---

Features

• Compare multiple sorting algorithms:

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Arrays.sort (TimSort)

• Visual performance comparison:

  • Bar Chart
  • Line Chart
  • Horizontal Chart

• Displays:

  • Execution Time (ms)
  • Number of Comparisons
  • Number of Swaps

• Supports:

  • Different data types (Random, Sorted, Reverse, etc.)
  • Custom dataset upload (CSV / TXT file)

• Interactive GUI with:

  • Algorithm selection
  • Array size control
  • Execution logs
  • Real-time benchmarking

---

Internal Working Visualization

• Step-by-step visualization of sorting algorithms

• Highlights:

  • Comparisons
  • Swaps
  • Sorted elements

---

How to Run

1. Open the file in any Java IDE (Eclipse / IntelliJ / VS Code)
2. Compile the program
3. Run the main class AlgorithmComparator
4. Use GUI to select algorithms and run benchmark

---

Output

• Performance comparison table
• Graphical visualization
• Execution logs

---

Note

This project was developed as part of learning Core Java concepts including GUI development, multithreading, and algorithm analysis.

---

Learning Outcome

• Understanding of sorting algorithms
• Performance comparison techniques
• Java Swing GUI development
• Multithreading and concurrency