Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/sarahabuirmeileh/sortingalgorithmsanalysis
C++ code implements various sorting algorithms and measures their performance
https://github.com/sarahabuirmeileh/sortingalgorithmsanalysis
bubble-sort bubblesort cplusplus insertion-sort merge-sort mergesort quicksort selection-sort sorting-algorithms
Last synced: about 2 months ago
JSON representation
C++ code implements various sorting algorithms and measures their performance
- Host: GitHub
- URL: https://github.com/sarahabuirmeileh/sortingalgorithmsanalysis
- Owner: SarahAbuirmeileh
- Created: 2024-03-13T13:26:13.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2024-03-13T13:32:08.000Z (10 months ago)
- Last Synced: 2024-03-13T14:47:27.781Z (10 months ago)
- Topics: bubble-sort, bubblesort, cplusplus, insertion-sort, merge-sort, mergesort, quicksort, selection-sort, sorting-algorithms
- Language: C++
- Homepage:
- Size: 2.93 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Sorting Algorithm Performance Comparison 🔥
This C++ code implements various sorting algorithms and measures their performance using the high_resolution_clock from the library. The sorting algorithms included in this code are:
1. Quick sort
2. Bubble sort
3. Insertion sort
4. Selection sort
5. Merge sort
The main purpose of this code is to compare the execution time of these sorting algorithms when sorting an array of randomly generated integers.
After running the code, the user can analyze the execution time of each sorting algorithm and compare their performance. Lower execution time indicates better performance in terms of speed.
Chart Representation:
To visualize the time differences between the sorting algorithms, a chart can be created using the data obtained from running the code. The x-axis can represent the sorting algorithms, and the y-axis can represent the time taken for each algorithm in nanoseconds.
## My results
