https://github.com/wwi2196/sorting-algorithms-analysis

Comparison of sorting algorithms by evaluating the number of steps and runtime.
https://github.com/wwi2196/sorting-algorithms-analysis

Last synced: 3 months ago
JSON representation

Comparison of sorting algorithms by evaluating the number of steps and runtime.

• Host: GitHub
• URL: https://github.com/wwi2196/sorting-algorithms-analysis
• Owner: WWI2196
• License: apache-2.0
• Created: 2024-06-11T14:45:47.000Z (12 months ago)
• Default Branch: master
• Last Pushed: 2024-08-07T07:27:30.000Z (10 months ago)
• Last Synced: 2025-01-29T22:45:02.981Z (4 months ago)
• Language: C++
• Homepage:
• Size: 27.3 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.txt

Awesome Lists containing this project

README

        
# Array-Based Sorting Algorithms Comparison

## Overview

This project develops a system designed to facilitate the comparison of sorting algorithms by evaluating the number of steps and runtime required for each algorithm.

## Features

- **Main Menu**: Offers options to test individual or multiple sorting algorithms, or to exit the program.

- **Individual Testing**: enables the testing of a single sorting algorithm1. The system will prompt the user to enter the desired size for an array, then it will generate a set of random integers to fill the array2. The chosen sorting algorithm will be applied to this array.

- **Multiple Testing**: Compares the performance of all sorting algorithms using the same data set.

## Sorting Algorithms Implemented

- Selection Sort

- Insertion Sort

- Merge Sort

- Quick Sort

- Counting Sort2