Quick Sort Algorithm

quick_sort.py

from typing import Generator
def quick_sort(sequence: list) -> Generator:
    if sequence.__len__() <= 1:
        yield from sequence
    else:
        low =  []
        high = []
        pivot = sequence.pop()
        for i in sequence:
            [low, high][i > pivot].append(i)
        yield from quick_sort(low)
        yield pivot
        yield from quick_sort(high)