This project compares the runtime performance of Insertion Sort and Merge Sort algorithms on arrays of increasing sizes. The goal is to visualize the point where Merge Sort starts outperforming Insertion Sort.
- Clone the repository : git clone https://github.com/birkasiyer/MergeSort-vs-InsertionSort.git
- Navigate to the project directory : cd MergeSort-vs-InsertionSort
- Run the python script and view the runtime comparison graph: python main.py
Python 3.x Matplotlib library
Install dependencies: pip install matplotlib
Feel free to contribute to the project by opening issues or submitting pull requests. Your feedback and contributions are welcome!