数据结构与算法---直接选择排序

void DirectSelectSort(int A[],int n)
{
        int i,j,k;
        int temp;

        for(i=0;i<n-1;i++)
        {
                k=i;
                for(j=i+1;j<n;j++)
                        if(A[j]< A[k])
                                k = j;
                if(i != k)
                {
                        temp = A[k];
                        A[k] = A[i];
                        A[i] = temp;
                }
        }
}

int main()
{
 int A[] = {10,50,2,65,31,145};
 DirectSelectSort(A,6);
 int i;
 for(i=0;i<6;i++)
  printf("%d ",A[i]);
 printf("\n");
 return 0;
}