选择排序

int main()
{
    int n = 10;
    int a[15] = {0,6,18,1,33,41,47,38,9,16,3};
    
    for(int i = 1 ; i < n ; i ++)
    {
        int minini = i;
        for (int j = i + 1 ; j <= n ; j ++)
        {
            if(a[j] < a[minini])
            {
                minini = j;
            }
        }
        swap(a[i] , a[minini]);
    }
    
    for (int i = 1; i <= n ; i ++)
    {
        cout << a[i] << ' ';
    }
    return 0;
}