Scribd
Upload
13 views3 pages

Sorting Graph

The document presents a comparison of various sorting algorithms, including Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, and Heap Sort, with their respective execution times for different input sizes. The data indicates that Quick Sort and Merge Sort generally perform better than the other algorithms across larger datasets. The performance of each sorting method is measured in seconds for input sizes ranging from 1,000 to 300,000.

Uploaded by

zakia.syeed51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
13 views3 pages

Sorting Graph

The document presents a comparison of various sorting algorithms, including Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, and Heap Sort, with their respective execution times for different input sizes. The data indicates that Quick Sort and Merge Sort generally perform better than the other algorithms across larger datasets. The performance of each sorting method is measured in seconds for input sizes ranging from 1,000 to 300,000.

Uploaded by

zakia.syeed51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Bubble Sort Insertion Sort

1000 0 1000 0 Bubble Sort


10000 0.6 10000 0.18 515
50000 14.05 50000 4.25 415
100000 56.9 100000 17.62 315
215
200000 229.44 200000 69.12
115
300000 513.34 300000 154.22 15
-85 1000 10000 50000 100000 200000 300000
Selection Sort Quick Sort
Column B
1000 0.003 1000 0
10000 0.214 10000 0
50000 5.184 50000 0.01 Quick Sort
100000 22.16 100000 0.02
0.07
200000 87.954 200000 0.05
0.05
300000 227.007 300000 0.065
0.03
0.01
Merge Sort Heap Sort
-0.01 00 0 0 00 00 00
1000 0.001 1000 0 10 00 00 00 00 00
10 50 1 0 2 0 3 0
10000 0.006 10000 0.03
50000 0.029 50000 0.012
Column E
100000 0.054 100000 0.023
200000 0.122 200000 0.045
300000 0.169 300000 0.071
Insertion Sort Selection Sort
160 300
110 200
60 100
10
0
0 300000 1000 10000 50000 100000 200000 300000 1000 10000 50000 100000 200000 300000
-40

Column E Column B

Merge Sort Heap Sort


0.17 0.08
0.12 0.06
0.07
0.04
0.02
0.02
00
0 -0.03 00 00
0
00
0 00 00 00
00 10 10 50 000 000 000 0
3 1 2 3 1000 10000 50000 100000 200000 300000

Column B Column E
ort

00000 300000

ort

0 200000 300000

nE

You might also like