140.递归法绘制三角形图案

#include <graphics.h>
#include <stdio.h>
void tria(xa,ya,xb,yb,xc,yc,n)
int xa,ya,xb,yb,xc,yc,n;
{
	int xp,yp,xq,yq,xr,yr;
	if(n>0)
	{
		xp=(xa+xb)/2;
		yp=(ya+yb)/2;
		xq=(xb+xc)/2;
		yq=(yb+yc)/2;
		xr=(xc+xa)/2;
		yr=(yc+ya)/2;
		moveto(xp,yp);
		lineto(xq,yq);
		lineto(xr,yr);
		lineto(xp,yp);
		tria(xa,ya,xp,yp,xr,yr,n-1);
		tria(xb,yb,xq,yq,xp,yp,n-1);
		tria(xc,yc,xr,yr,xq,yq,n-1);
	}
}

void main()
{
	int n,xa=10,ya=10,xb=10,yb=470,xc=630,yc=470;
	int gdriver=DETECT,gmode;
	printf("Input recursion depth( for exmaple, 7): ");
	scanf("%d",&n);
	initgraph(&gdriver,&gmode,"c:\\tc");
	cleardevice();
	setbkcolor(8);
	setcolor(2);
	moveto(xa,ya);
	lineto(xb,yb);
	lineto(xc,yc);
	lineto(xa,ya);
	tria(xa,ya,xb,yb,xc,yc,n);
	getch();
	closegraph();
}

文章来源: blog.csdn.net，作者：程序员编程指南，版权归原作者所有，如需转载，请联系作者。

原文链接：blog.csdn.net/weixin_41055260/article/details/124665510