迭代快速排序步骤-在turtle中实现可视化

import turtle

def draw_bars(arr):
    window = turtle.Screen()
    window.title("快速排序可视化")
    window.bgcolor("white")
    window.setup(width=800, height=600)

    t = turtle.Turtle()
    t.penup()
    t.goto(-300, -200)
    t.pendown()
    t.speed(0)

    max_height = max(arr)
    scaling_factor = 400 / max_height

    for i in range(len(arr)):
        t.forward(20)
        t.left(90)
        t.forward(arr[i] * scaling_factor)
        t.right(90)
        t.forward(20)
        t.right(90)
        t.forward(arr[i] * scaling_factor)
        t.left(90)

    turtle.done()

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    
    pivot = arr[0]
    less = [x for x in arr[1:] if x <= pivot]
    greater = [x for x in arr[1:] if x > pivot]
    
    return quick_sort(less) + [pivot] + quick_sort(greater)

if __name__ == "__main__":
    arr = [6, 3, 8, 2, 9, 1, 5, 7, 4]
    sorted_arr = quick_sort(arr)
    print(sorted_arr)
    draw_bars(sorted_arr)