Sorting Algorithm Runtime Analyser Using Test Driven Development | Java

Continuing our journey with Sorting Algorithm Runtime Analyzer. This analyzer runs all sorting algorithm with the randomly generated array of a given size and records the runtime.

This way, you can analyse and compare different algorithms and how much time they take to sort the given array.

So far I found that the bottom-up merge sort is the fastest. And there is a reason for that,
- It doesn't make recursive calls that are slower

On the other hand, Quicksort is fast, but it is a tad bit slower than the bottom-up merge sort since it is implemented using a recursive algorithm.

Do let me know your reviews on the same.

Next, I'll be picking up data structures. Starting with Stack. Hope to see you in the next video. And don't forget to subscribe and thumbs up.

#algorithm #RuntimeAnalyser #Sorting