Sortowanie | Ilość elementów | Pomiar 1 | Pomiar 2 | Pomiar 3 | Średnia |
---|---|---|---|---|---|
Bubble sort | 1000 | 0.007961s | 0.006914s | 0.007335s | 0.007403s |
Insertion sort | 1000 | 0.001755s | 0.001837s | 0.001952s | 0.001848s |
Selection sort | 1000 | 0.003481s | 0.003381s | 0.003447s | 0.003437s |
Quick sort | 1000 | 0.000106s | 0.000104s | 0.000113s | 0.000108s |
Standard sort | 1000 | 0.000196s | 0.000198s | 0.000194s | 0.000196s |
Bubble sort | 10000 | 0.728017s | 0.696173s | 0.688394s | 0.704195s |
Insertion sort | 10000 | 0.179476s | 0.178839s | 0.179624s | 0.179313s |
Selection sort | 10000 | 0.333924s | 0.340665s | 0.336254s | 0.336948s |
Quick sort | 10000 | 0.001214s | 0.001206s | 0.001187s | 0.001202s |
Standard sort | 10000 | 0.002339s | 0.002404s | 0.002396s | 0.002380s |
Najszybszym algorytmem jest zdecydowanie Quick Sort, przebijając Bubble Sorta w przypadku 1000 elementów 75-krotnie, a w przypadku 10000 elementów aż 700-krotnie.