https://github.com/cankatabaci/performancetestforsortingalgorithms
This project is a homework made in the course of Data Structures for compare the performance sorting algorithms.
https://github.com/cankatabaci/performancetestforsortingalgorithms
performance-testing sorting-algorithms sorting-algorithms-homework sorting-algorithms-implemented
Last synced: about 2 months ago
JSON representation
This project is a homework made in the course of Data Structures for compare the performance sorting algorithms.
- Host: GitHub
- URL: https://github.com/cankatabaci/performancetestforsortingalgorithms
- Owner: cankatabaci
- Created: 2017-03-25T01:21:29.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2017-03-26T01:03:58.000Z (over 8 years ago)
- Last Synced: 2025-03-28T07:40:35.710Z (7 months ago)
- Topics: performance-testing, sorting-algorithms, sorting-algorithms-homework, sorting-algorithms-implemented
- Language: C#
- Homepage:
- Size: 14.6 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Performance Test For Sorting Algorithms
This project is a homework made in the course of Data Structures.
Purposes of the project; Buble, Selection, Heap, Quick and Insertion Sort sorting algorithms to compare their performance. 7 different series including 100, 750, 1500, 7500, 15000, 75000 and 150000 random elements were produced.
### Sorting Performances
5 Different sorting algorithms were compared with 7 different data sets and the results were obtained as follows.
### Total working time(millisecond) by value ranges
| Algorithms | 100 | 750 | 1500 | 7500 | 15000 | 75000 | 150000 |
| ------ | ------ | ------ | ------ | ------ | ------| ------ | ------ |
|Buble Sort|0 |0 |0 |145 |286 |14662 |76890 |
|Quick Sort|0 |0 |0 |0 |1 |8 |18 |
|Heap Sort|0 |0 |0 |1 |3 |41 |94 |
|Insertion Sort|0 |0 |0 |0 |157 |6947 |25469 |
|Selection Sort|0 |1 |4 |120 |468 |11982 |47912 |