TutorSyntax A-level Python | Lesson 6: Merge sort and complexity

Learning goal: Use divide and conquer to implement merge sort without calling sorted() or list.sort().

1. Read the worked example on the site.
2. Complete the starter without looking at the solution.
3. Add normal, boundary and invalid tests.
4. Compare with the reference solution; explain your improvements.

A-level note: OCR H446 algorithms / AQA 7517 algorithms. These are original practice materials, not endorsed exam-board tasks.
