写一个basic mondrian的算法伪代码

以下是一个基本的 Mondrian 算法的伪代码：

function mondrian(start_x, end_x, start_y, end_y, min_size, max_iterations)
    if max_iterations == 0 or (end_x - start_x <= min_size and end_y - start_y <= min_size) then
        // The maximum number of iterations has been reached, or the cell is too small to be split further.
        // Do not split and return the cell.
        return Cell(start_x, end_x, start_y, end_y)
    else
        // Split the cell into two sub-cells along a random axis.
        if random() < 0.5 then
            // Split along the x-axis.
            split_x = random(start_x + min_size, end_x - min_size)
            left_cell = mondrian(start_x, split_x, start_y, end_y, min_size, max_iterations - 1)
            right_cell = mondrian(split_x, end_x, start_y, end_y, min_size, max_iterations - 1)
        else
            // Split along the y-axis.
            split_y = random(start_y + min_size, end_y - min_size)
            top_cell = mondrian(start_x, end_x, start_y, split_y, min_size, max_iterations - 1)
            bottom_cell = mondrian(start_x, end_x, split_y, end_y, min_size, max_iterations - 1)
        
        // Return the composite cell containing the sub-cells.
        return CompositeCell(left_cell, right_cell, top_cell, bottom_cell)
    end if
end function

该算法会递归地将一个矩形区域分成两个子区域，直到达到最大迭代次数或者区域大小小于最小允许值。在每次迭代中，算法会随机选择一个轴（x 或 y）并在该轴上将区域分成两个子区域。最后，算法返回一个包含所有子区域的组合单元格对象。