1) Write MATLAB functions for the three sorting algorithms presented:

Insertion Sort
Merge Sort (In order to implement this sort you will need to write a function for the Merge algorithm)
Counting Sort
2) Create random arrays of elements between 0 and 10 of sizes 10, 1000, 1000000

3) Compare the times it takes to for each algorithm to sort these three arrays. (Don’t forget that the counting sort necessitates integers)

Böyle bir şey yapmam gerekiyor nasıl yapabilirim acaba çıkış yolum ne olabilir yardım edebilir misiniz acaba?