Merge sorts work by splitting an array into individual elements then sorting them into arrays of two elements. Those are then sorted into arrays of four elements and so on until it is recombined
How do merge sorts combine arrays in terms of position?
It iterates through each inserting them into their correct positions left to right
