while (a[j]<a[j- 1 ] && j!= 0 )

for (i= 3 ; i>= 0 ;i--)
{
  int j=i;
  while (a[j]<a[j+ 1 ] && j< 4 ) 
  {
	max=a[j+ 1 ]; 
	a[j+ 1 ]=a[j]; 
	a[j]=max;
	j=j+ 1 ;
  }
}
max=a[ 4 ];
for (i= 0 ;i< 5 ;i++) cout<<"a["<<i<<"]= "<<a[i]<<" "; cout<<"max="<<max<<endl;

int main()
{
int a[ 5 ], i;
for (i= 0 ;i< 5 ;i++)
{
	cout<<"a["<<i<<"]= ";
	cin>> a[i];
}
for (i= 0 ;i< 5 ;i++) cout<<"a["<<i<<"]= "<<a[i]<<" "; cout<<endl<<endl;
cout<<"Sortiruem po vozrastaniyu:"<<endl;
int min=a[ 0 ], j;
for (i= 1 ; i< 5 ;i++)
{
	j=i;
	while (a[j]<a[j- 1 ] && j!= 0 ) 
	{
		min=a[j]; 
		a[j]=a[j- 1 ]; 
		a[j- 1 ]=min;
		j=j- 1 ;
	}
}
min=a[ 0 ];
for (i= 0 ;i< 5 ;i++) cout<<"a["<<i<<"]= "<<a[i]<<" "; cout<<"min="<<min<<endl;

i= 0 , j= 0 ;
cout<<"Sortiruem po ubyvaniyu:"<<endl;
int max=a[ 0 ];
for (i= 1 ; i< 5 ;i++)
{
	j=i;
	while (a[j]>a[j- 1 ] && j!= 0 ) 
	{
		max=a[j]; 
		a[j]=a[j- 1 ]; 
		a[j- 1 ]=max;
		j=j- 1 ;
	}
}
max=a[ 0 ];
for (i= 0 ;i< 5 ;i++) cout<<"a["<<i<<"]= "<<a[i]<<" "; cout<<"max="<<max<<endl;