I\'m reading up on sort algorithms and came across this code:
def mergeSort(arr): if len(arr) > 1: mid = len(arr)//2 L = arr[:mid]