def quick_sort(list_a: list) -> list: if len(list_a) > 0: first = list_a[0] left = quick_sort([l for l in list_a[1:] if l < first]) right = quick_sort([l for l in list_a[1:] if l > first]) return left + [first] + right else: return list_a print(quick_sort([1, 2, 3, 4, 5, 6, 73, 2, 1, 23, 5]))