voidSelectionSort(int a[],int N )
{
int min;
for (int i=0; i<N-1 ; i++)
{
min = i;
for(int j = i+1; j < N ; j++)
if (a[j] < a[min])
min = j;
if (min != i)
Swap(a[min], a[i]);
}
}
voidInterchangeSort(int a[], int N)
{
int i, j;
for (i = 0 ; i<N-1 ; i++)
for (j =i+1; j < N ; j++)
if(a[j]< a[i]) ã
Swap(a[i],a[j]);
}
voidBubbleSort(int a[],intN)
{
inti, j;
for (i = 0 ; i<N-1 ; i++)
for (j =N-1; j>i ; j --)
if(a[j]< a[j-1])
Swap(a[j], a[j-1]);
}
voidQuickSort(int a[], int left, int right)
{
int i, j, x;
if (left >= right) return;
x = a[(left+right)/2];
i = left; j = right;
while(i < j) {
while(a[i] < x) i++;
while(a[j] > x) j--;
if(i <= j) {
Swap(a[i], a[j]);
i++ ; j--;
}
}
QuickSort(a, left, j);
QuickSort(a, i, right);
}
Bạn đang đọc truyện trên: Truyen2U.Pro