Need explanation please on this quicksort recursive function in python

Question

def qsort(list): if not list: return [] else: pivot = list[0] less = [x for x in list[1:] if x < pivot] more = [x for x in list[1:] if x >= pivot] return qsor