Cod sursa(job #3196558)

Utilizator rapidu36Victor Manz rapidu36 Data 24 ianuarie 2024 11:24:01
Problema Sortare prin comparare Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <fstream>
#include <cstdlib>

using namespace std;

const int N = 5e5;

int v[N];

void part_3_secv(int v[], int st, int dr, int &p_st, int &p_dr)
{
    int i = st;
    p_st = st;
    p_dr = dr - 1;
    while (i <= p_dr)
    {
        if (v[i] < v[dr])///v[i] e in zona albastra
        {
            swap(v[i++], v[p_st++]);
        }
        else if (v[i] > v[dr])///v[i] e in zona rosie
        {
            swap(v[i], v[p_dr--]);
        }
        else///v[i] e in zona galbena
        {
            i++;
        }
    }
    swap(v[dr], v[++p_dr]);///v[dr] trebuie adus in zona galbena
    ///si mutata granita dintre galben si rosu
}

void qs(int v[], int st, int dr)
{
    if (st >= dr)
    {
        return;
    }
    int p_st, p_dr;
    part_3_secv(v, st, dr, p_st, p_dr);
    qs(v, st, p_st - 1);
    qs(v, p_dr + 1, dr);
}

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    int n;
    in >> n;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    ///shuffle
    for (int i = n - 1; i > 0; i--)
    {
        int poz_rand = rand() % (i + 1);
        swap(v[i], v[poz_rand]);
    }
    qs(v, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        out << v[i] << " ";
    }
    in.close();
    out.close();
    return 0;
}