Computer Science - Algorithms - Merge sort - Merge Sort Deep Dive

5 steps. Step 1 'Divide and Conquer': Split array in half (recursively) until single elements. Single elements are trivially sorted. Merge sorted halves back together. Step 2 'Merge Function': def merge(left, right): result = []; i = j = 0; while i<len(left) and j<len(right): if left[i]<=right[j]: r