3.cpp

一些常用的递归算法

#include<iostream.h>//maopao
void maopao(int data[],int length )
{
	int segment,loop,temp;
	//
	//maopao suan fa
	for(segment=0;segment<=length-1;segment=segment+1)
	{
		for(loop=length-1;loop>=segment;loop=loop-1)
		{
			if(data[loop]<data[loop-1])
			{
				temp=data[loop];
				data[loop]=data[loop-1];
				data[loop-1]=temp;
			}
		}
	}
	return ;
}
int main()
{
	const int max_num=6;
	int data[max_num];
	int loop;
	
	cout<<"please input"<<max_num<<endl;
	for(loop=0;loop<=max_num-1;loop++)
	{
		cout<<"No."<<loop+1<<":";
		cin>>data[loop];
	}
	maopao(data,max_num);
	//
	cout<<endl<<"after swaping......."<<endl;
	for(loop=0;loop<=max_num;loop++)
	{
		cout<<"No."<<loop+1<<data[loop]<<"\n";
	}
	return 0;

}