typedef int TYPE;
#define N 100
void exchange(TYPE A[], int a, int b){TYPE tmp = A[a]; A[a] = A[b]; A[b] = tmp;}
void selectionSort(TYPE A[], int n)
{
int i, j, minIndex;
for(i = 0; i < n-1; ++i)
{
minIndex = i;
for(j = i+1; j < n; ++j)
if(A[j] < A[minIndex])
minIndex = j;
exchange(A, i, minIndex);
}
}
void insertionSort(TYPE A[], int n)
{
int i, j; TYPE key;
for(i = 1; i < n; ++i){
key = A[i];
j = i-1;
while(j>=0 && A[j] > key){
A[j+1] = A[j];
--j;
}
A[j+1] = key;
}
}
选择排序
最新推荐文章于 2012-05-08 11:49:51 发布