只看CLRS也能写算法，哈哈

int arr[10]{5, 2, 1, 8, 9, 6, 3, 7, 4, 0};
    for (int i = 0; i < 10; ++i)
    {
        
        int j = i + 1;

        for (; j<10; ++j)
        {    
            int key = arr[i];
            if (key > arr[j])
            {
                int exchange = arr[i];
                arr[i] = arr[j];
                arr[j] = exchange;
            }
        }    
    }