用turtle库递归算法实现正方形分割

好的，下面是用turtle库递归算法实现正方形分割的代码：

import turtle

def draw_square(length, depth):
    if depth == 0:
        return
    turtle.forward(length/2)
    turtle.left(90)
    turtle.forward(length/2)
    turtle.right(90)
    turtle.color("red")
    turtle.begin_fill()
    for i in range(4):
        turtle.forward(length)
        turtle.left(90)
    turtle.end_fill()
    turtle.left(90)
    turtle.forward(length/2)
    turtle.right(90)
    draw_square(length/2, depth-1)
    turtle.right(90)
    turtle.forward(length)
    turtle.left(90)
    draw_square(length/2, depth-1)
    turtle.left(90)
    turtle.forward(length/2)
    turtle.right(90)
    draw_square(length/2, depth-1)
    turtle.right(90)
    turtle.forward(length)
    turtle.left(90)
    draw_square(length/2, depth-1)
    turtle.left(90)
    turtle.forward(length/2)
    turtle.right(90)
    turtle.color("white")
    turtle.begin_fill()
    for i in range(4):
        turtle.forward(length)
        turtle.left(90)
    turtle.end_fill()
    turtle.right(90)
    turtle.penup()
    turtle.forward(length/2)
    turtle.pendown()

turtle.speed(0)
draw_square(200, 4)
turtle.done()

这个函数`draw_square`的参数是正方形的边长和递归的深度。在每次递归中，首先绘制正方形的左下角，然后绘制大正方形的下一层4个小正方形，最后回到起点。在递归的过程中，每次将正方形的边长减半，深度减1，直到深度为0时结束递归。