c++选择排序法

1.选择排序法：

#include <iostream> 
void main(void)
{
    int i;
    int j;
    int n;
    int tem;
    int a[] = {10,2,4,7,8,3,1,5,6,9};
    n = sizeof(a) / sizeof(a[0]);
    printf("排序前的数组");
    for (i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n");
    for (i = 0; i < n; i++)
    {
        for (j = i+1; j < n;j++)
        {
            if (a[i]>a[j])
            {
                tem = a[i];
                a[i] = a[j];
                a[j] = tem;
            }

        }   
    }
    printf("排序后的数组");
    for (i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
    system("pause");
}