insert.cpp

常见算法

//

#define M 20
#include<iostream>
using namespace std;
main()
{   int i,j,key;
	int number[M];
	cout<<"input "<<M<<"numbers:"<<"\n";
	for (i=0;i<M;i++)
	{
		cin>>number[i];
	}
	
		cout<<"this is the "<<M<< "numbers:"<<"\n";
        for(i=0,j=1;i<M;i++,j++)
		{
            cout<<number[i]<<"\t";
			if(j%5==0)
				cout<<"\n";
		
		}

		for(j=1;j<M;j++)
		{
           i=j-1;key=number[j];
           if(number[i]<key)
		    number[i+1]=key;
		    else
			{
		        
		        while(i>=0&&number[i]>=key)
				{
                  
			      number[i+1]=number[i];
				  i--;
				}
              number[i+1]=key;
				
			}
		}
        
	cout<<"this is the "<<M<< "numbers:"<<"\n";
    for(i=0,j=1;i<M;i++,j++)
		{
            cout<<number[i]<<"\t";
			if(j%5==0)
				cout<<"\n";
		
		}

	return 0;
}