C++ primer puls 7.9迭代法

#include <iostream>

using namespace std;

void countdown(int n);

int main(void)
{
	countdown(4);

	return 0;  
}

void countdown(int n)
{
	cout << "Counting down.... " << n << "(n at address: " << &n << ")" << endl;	   	//statement1
	if(n > 0)
		countdown(n-1);
	cout << n << ": Kadoom" << "(n at address: "<< &n << ")" << endl;			//statement2
}

#include <iostream>

using namespace std;

const int Len = 66;
const int Divs = 6;

void subdivide(char ar[], int low, int high, int levels);

int main(void)
{
	char ruler[Len];

	for(int i = 0; i < Len; i++)
		ruler[i] = ' ';

int min = 0;
int max = Len - 2;
	ruler[Len-1] = '\0';
	ruler[min] = ruler[max] = '|';

	cout << ruler << endl;

	for(int i = 1; i <= Divs; i++)
	{
		subdivide(ruler, min, max, i);
		cout << ruler << endl;
	}

	return 0;
}

void subdivide(char ar[], int low, int high, int levels)
{
	if(levels == 0)
		return;

	int mid = (low + high) / 2;
	ar[mid] = '|';

	subdivide(ar, low, mid, levels-1);
	subdivide(ar, mid, high, levels-1);
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值