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	750	1500	7500	15000	75000	150000
Buble Sort	0	0	145	286	14662	76890
Quick Sort	0	0	0	1	8	18
Heap Sort	0	0	1	3	41	94
Insertion Sort	0	0	0	157	6947	25469
Selection Sort	1	4	120	468	11982	47912

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!