Analyzing different algorithms and compare their running times in ms. Algorithms are Matrix Multiplication, Finding Maximum Element, Bubble Sort Algorithm, Quick Sort Algorithm and Binary Search Algorithm
| Algorithms /n | 100 | 300 | 500 | 700 | 900 | 1100 | 1300 | 1500 | 1700 | 1900 | 2100 | 2300 | 2500 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Matrix Multiplication |
5 | 135 | 701 | 2004 | 7154 | 11935 | 23768 | 41761 | 61117 | 87015 | 121674 | 161623 | 213651 |
| Bubble Sort | 0,21 | 1,909 | 5,359 | 10,45 | 17,125 | 26,262 | 37,247 | 50,435 | 64,702 | 79,882 | 104,932 | 123,787 | 156,053 |
| Finding Max. Element |
0,0002 | 0,0006 | 0,0011 | 0,0016 | 0,0018 | 0,0022 | 0,0026 | 0,0031 | 0,0035 | 0,0038 | 0,0042 | 0,0047 | 0,0051 |
| Quick Sort | 0,0149 | 0,1227 | 0,3318 | 0,6386 | 1,044 | 1,5557 | 2,2126 | 2,942 | 3,7464 | 4,7001 | 5,766 | 6,881 | 8,143 |
| Binary Search | 0,0034 | 0,0151 | 0,0402 | 0,0533 | 0,075 | 0,1041 | 0,1312 | 0,1497 | 0,1732 | 0,2038 | 0,2198 | 0,2382 | 0,2545 |