Merge sort implementation

Question

Implement the merge sort presented without the slice operation to produce an algorithm which is O(nl log n)

Answer 1

https://code.sololearn.com/ci1q8c48k5Y2/#py

You owe me a coockie. It took me almost an hour.

Answer 2

Is this your homework for tomorrow?))

Answer 3

How did you know?) It's something like that

Answer 4

ooh, Thank you very much