Cod sursa(job #1191397)

Utilizator Cristian1997Vintur Cristian Cristian1997 Data 27 mai 2014 15:16:42
Problema Sortare prin comparare Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
using namespace std;
#include <fstream>
//#include <ctime>
//#include <cstdlib>
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int v[500010];

void swap1(int, int) ;
void quick_sort(int, int) ;
int divide(int, int) ;



int main()
{
    //srand(time(NULL));

    int i, n;
    fin>>n;
    for(i=0; i<n; ++i) fin>>v[i];
    /*for(i=0; i<n/2; ++i)
    {
        a=rand()%n; b=rand()%n;
        swap1(a, b);
    }*/
    quick_sort(0, n-1);
    for(i=0; i<n; ++i) fout<<v[i]<<' ';
    return 0;
}

void swap1(int a, int b)
{
    int aux=v[a];
    v[a]=v[b];
    v[b]=aux;
}

void quick_sort(int p, int u)
{
    int m=divide(p, u);
    if(p<m) quick_sort(p, m-1);
    if(m<u) quick_sort(m+1, u);
}

int divide(int st, int dr)
{
    //int random = (rand())%((dr-st+1)) + st;
    int random = (st+dr)/2;
    swap1(random, st);
    int x=v[st];
    while(st<dr)
    {
        while(st<dr && v[dr]>=x) --dr;
        v[st]=v[dr];
        while(st<dr && v[st]<=x) ++st;
        v[dr]=v[st];
    }
    v[st]=x;
    return st;
}