insertionsort.cpp

来自「this program is insertion_sort that writ」· C++ 代码 · 共 43 行

//***1)in barname yek araye migirad va be raveshe insertionsort an ra sort mikonad
//***2)be in nokte tavajoh shavad ke araye vaghty dar metod taghyir kard asle araye
//dar main ham taghyir mikonad

#include <iostream.h>
#include<conio.h>
void insert(int *);
int main()
{
	int arr[5]={2,1,4,5,6};
	cout<<"array befor sort "<<endl;
    
	for(int i=0;i<5;i++)
		cout<<arr[i]<<"  ";

	insert(arr);
    cout<<"\narray after sort "<<endl;
	
	for( i=0;i<5;i++)
		cout<<arr[i]<<"  ";

	getch();
	
	return 0;
}
//***************************************************************************
void insert(int *arr1)
{
	for(int j=1;j<5;j++)
	{
		int key=arr1[j];
		int i=j-1;
		while(i>=0 && arr1[i]>key)
		{
			arr1[i+1]=arr1[i];
			i=i-1;
		}
		arr1[i+1]=key;
	}
}
//***************************************************************************