A comparison of two sorting algorithms — training and academic material for computer science learners.
About the paper
This material compares two sorting algorithms: Selection Sort and Merge Sort. It is intended for learners who want to understand how the algorithms differ in complexity and behaviour. It is published as a Google Colab notebook.
How to use it
- Open the notebook in Google Colab.
- Run the examples and compare both algorithms on your own data.