// 'Straight exchange' Algorythm. File: Sort02.cpp
#include <iostream.h>
int n=7;
int a[]={0, -28, 1024, 1, -2, 60, 1}; // input array.
int j,k,L,R,x,i; // other variables...
void main()
{ L=2;
R=n;
k=n;
do
{ for (j=R; j>L; j--)
{ if (a[j-1]>a[j])
{ x = a[j-1];
a[j-1] = a[j];
a[j]=x;
k=1;
}
}
L=k++;
for (j=L; j<R; j++)
{ if (a[j-1]>a[j])
{ x=a[j-1];
a[j-1]=a[j];
a[j]=x;
k=j;
}
}
R=k--;
} while (L>R);
for (i=0;i<7;i++)
cout<<i<<"-th element is: "<<a[i]<<"\n";
}
|
|