クイックソートeoj1035のC++再帰実装

行ごとに 1 回出力します

原則的な提案はhttps://blog.csdn.net/qq_35344198/article/details/106785849?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164808040316782089321938%2522%25 2C%252 を参照してください。 2scm%2522%253A%252220140713.130102334.. % 2522%257D&request_id=164808040316782089321938&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_click~default-8-106785849.142^v3^pc_search_insert_es_download ,143^ v4^register&utm_term=%E5%BF%AB%E9% 80 %9F%E6%8E%92%E5%BA%8F&spm=1018.2226.3001.4187j

非常に明確です。コードは次のとおりです 

#include <iostream>

using namespace std;

/*

*/
int len; 
void quicksort(int* arr, int left, int right)
{
    int copyright = right;
    int copyleft = left;
    int pivot = arr[left];
    int key = left;
    while (left <= right)
    {
        if (key == left)
        {
            while (arr[right] >=pivot&&right>key)
            {
                right--;
            }
            arr[key] = arr[right];
            key = right;
            left++;
        }
        else if (key == right)
        {
            while (arr[left] <=pivot&&left<key)
            {
                left++;
            }
            arr[key] = arr[left];
            key = left;
            right--;
        }
    }

    arr[key] = pivot;

    for (int j = 0; j <len-1; j++)
    {
        cout << arr[j] << " ";
    }
    cout << arr[len-1] << endl;

    if (key-copyleft > 1)
    {
        quicksort(arr, copyleft, key - 1);
    }
    if (copyright - key > 1)
    {
        quicksort(arr, key+1, copyright);
    }
    
    

}

int main()
{
    cin >> len;
    int* arr = new int[len];
    for (int i = 0; i < len; i++)
    {
        cin >> arr[i];
    }
    quicksort(arr, 0, len - 1);




    return 0;
}