Cè¯è¨æºä»£ç ï¼
#include "stdio.h"
/* 对æ°ç»startIndexä½ç½®èµ·ï¼é¿åº¦ä¸ºlengthçå
ç´ è¿è¡éåºæå */
void sort(int arr[], int startIndex, int length)
{
int i, j, k;
int temp;
for(i=0; i<length-1; i++)
{
k = i;
for(j=i+1; j<length; j++)
if(arr[j+startIndex] > arr[k+startIndex])
k = j;
if(k != i)
{
temp = arr[k+startIndex];
arr[k+startIndex] = arr[i+startIndex];
arr[i+startIndex] = temp;
}
}
}
void main()
{
int arr[] = {2,4,6,8,10,12,14,16,18,20};
int size = 10;
int startIndex = 3, length = 5;
int i;
printf("before sort : ");
for(i=0; i<size; i++)
printf("%d ", arr[i]);
printf("\n");
sort(arr, startIndex, length);
printf("after soft : ");
for(i=0; i<size; i++)
printf("%d ", arr[i]);
printf("\n");
}
温馨提示:答案为网友推荐,仅供参考