#include <stdio.h>
typedef int elemType;
void selectSort(elemType *arr,int arrLength)
{
int index=0;
elemType currentMin;
int positionOfMin;
int i;
elemType tempval;
if (NULL == arr) return;
for (index = 0;index<arrLength;++index)
{
currentMin = arr[index];
positionOfMin = index;
for (i=index;i<arrLength;++i)
{
if (arr[i] < currentMin)
{
currentMin = arr[i];
positionOfMin = i;
}
}
tempval = arr[index];
arr[index] = arr[positionOfMin];
arr[positionOfMin] = tempval;
}
}
void printArr(elemType *arr,int arrSize)
{
int i=0;
while (i<arrSize)
{
printf("%d ",arr[i++]);
}
printf("\n");
}
int main(void)
{
elemType arr[]={1,5,4,2,6,9,2,3,11,0,56,232,561,2,6,11,2,76};
int size = sizeof(arr)/sizeof(elemType);
printf("排序前:");
printArr(arr,size);
selectSort(arr,size);
printf("排序后:");
printArr(arr,size);
return 0;
typedef int elemType;
void selectSort(elemType *arr,int arrLength)
{
int index=0;
elemType currentMin;
int positionOfMin;
int i;
elemType tempval;
if (NULL == arr) return;
for (index = 0;index<arrLength;++index)
{
currentMin = arr[index];
positionOfMin = index;
for (i=index;i<arrLength;++i)
{
if (arr[i] < currentMin)
{
currentMin = arr[i];
positionOfMin = i;
}
}
tempval = arr[index];
arr[index] = arr[positionOfMin];
arr[positionOfMin] = tempval;
}
}
void printArr(elemType *arr,int arrSize)
{
int i=0;
while (i<arrSize)
{
printf("%d ",arr[i++]);
}
printf("\n");
}
int main(void)
{
elemType arr[]={1,5,4,2,6,9,2,3,11,0,56,232,561,2,6,11,2,76};
int size = sizeof(arr)/sizeof(elemType);
printf("排序前:");
printArr(arr,size);
selectSort(arr,size);
printf("排序后:");
printArr(arr,size);
return 0;
}
结果: