Split the array in the middle and repeat until you only have an array with one element. Then sort each side (left and right). Litt som fletting
Merge-sort is not an In-Place Algorithm, since Merge creates two arrays L and R.
Runtime
Worst case , which is way better than Insertion Sort ’s runtime of
How it works
Uses the Merge function
