The latest articles on DEV Community by Gabriel de Jesus (@senseei). https://dev.to/senseei https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1435078%2F545dc8e7-9a3d-4ac3-b8e0-2e0bf58555bc.jpeg https://dev.to/senseei en Gabriel de Jesus Fri, 19 Apr 2024 16:51:54 +0000 https://dev.to/senseei/sorting-algorithms-performance-analysis-5c54 https://dev.to/senseei/sorting-algorithms-performance-analysis-5c54 <p>For those who study algorithms and programming logic, we know there are some powerful algorithms in matter of <strong>efficiency</strong>. But have you ever seen numbers showing the real difference between them?<br> I asked that to myself and I decided to implement by myself some famous algorithms and timed them when sorting two particulars arrays of <strong>n</strong> size. We can see it bellow:</p> <blockquote> <h4> Testing sorting algorithms </h4> <h6> Array length: 100000 </h6> <p>Testing <strong>Merge Sort</strong>...<br> Best case average time: 0.045 seconds<br> Worst case average time: 0.041 seconds<br> Testing <strong>Heap Sort</strong>...<br> Best case average time: 0.022 seconds<br> Worst case average time: 0.016 seconds<br> Testing <strong>Quick Sort</strong>...<br> Best case average time: 0.021 seconds<br> Worst case average time: 0.021 seconds<br> Testing <strong>Selection Sort</strong>...<br> Best case average time: 16.457 seconds<br> Worst case average time: 18.538 seconds<br> Testing <strong>Bubble Sort</strong>...<br> Best case average time: 0.001 seconds<br> Worst case average time: 40.580 seconds</p> </blockquote> <p>the average gets more precise when you increase the times you execute the algorithms, in this case, each algorithm has been executed 10 times. I choose that amount because the Selection and Bubble would take a lot to finish if I insert higher values..</p> algorithms programming performance