有没有没有递归的快速排序的Python实现？

def quick_sort(arr):
    stack = [(0, len(arr) - 1)]  # 使用栈来模拟递归调用
    while stack:
        low, high = stack.pop()
        if low < high:
            pivot = partition(arr, low, high)
            if pivot > low:
                stack.append((low, pivot - 1))
            if pivot < high:
                stack.append((pivot + 1, high))
    return arr

def partition(arr, low, high):
    pivot = arr[high]
    i = low - 1
    for j in range(low, high):
        if arr[j] <= pivot:
            i += 1
            arr[i], arr[j] = arr[j], arr[i]
    arr[i + 1], arr[high] = arr[high], arr[i + 1]
    return i + 1

# 使用示例
arr = [5, 3, 8, 4, 2, 7, 1, 6]
sorted_arr = quick_sort(arr)
print(sorted_arr)