The Sorting System is designed to help users sort dynamically allocated data using nine different sorting algorithms. It provides an interactive menu for selecting a sorting method, supports various data types using templates, and displays each sorting step for better understanding. Additionally, it measures execution time to analyze efficiency.
- ✅ Insertion Sort
- ✅ Selection Sort
- ✅ Bubble Sort
- ✅ Shell Sort
- ✅ Merge Sort
- ✅ Quick Sort
- ✅ Count Sort (Only for integers)
- ✅ Radix Sort (Only for integers)
- ✅ Bucket Sort (Not allowed for chars and strings)
- The program displays a menu listing all nine sorting algorithms.
- Users can select a sorting method by entering a number from 1 to 9.
- Users define the dataset size and input values dynamically.
- Sorting algorithms are implemented using templates (T).
- Supports multiple data types:
int,float,double,string, etc.
- After every iteration, the current state of the array is printed.
- For Quick Sort, an example visualization:
Data: 78 34 12 90 50 60 Pivot: 60 → [34, 12, 50] 60 [78, 90] Pivot: 12 → [12] 34 50 60 [78, 90] Pivot: 90 → [78] 90
- The program measures and displays execution time for each sorting algorithm.
- Includes test cases for each part of the problem to validate correctness.
Welcome to Sorting System
Select Sorting Algorithm:
1. Insertion Sort
2. Selection Sort
3. Bubble Sort
...
Enter your choice: 5
Enter dataset size: 6
Enter elements: 78 34 12 90 50 60
Sorting Steps:
...
Execution Time: X msContributions are welcome! Feel free to fork the repo and submit a pull request.
- Esraa Emary Abd El-Salam: GitHub - LinkedIn
- Mariam Badr Yehia: GitHub - LinkedIn
- George Malak Magdy: GitHub - LinkedIn
- John Ayman Demian: GitHub - LinkedIn
- Mohammed Atef Abd El-Kader: GitHub - LinkedIn
This project is licensed under the MIT License.
✨ Developed with ❤️ in C++ ✨