Cod sursa(job #2280508)

Utilizator stefzahZaharia Stefan Tudor stefzah Data 10 noiembrie 2018 18:44:48
Problema Sortare prin comparare Scor 60
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.88 kb
#include <fstream>
#include <cmath>
#include <iostream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int N,R,a[500005],b[500005],aux;
void Sortare(int st, int dr)
{
    int i,ok=1;
    while(ok)
    {
        ok=0;
        for(i=st; i<dr; i++)
        {
            if(a[i]>a[i+1])
            {
                aux=a[i];
                a[i]=a[i+1];
                a[i+1]=aux;
                ok=1;
            }
        }
    }
   //for(i=st;i<=dr;i++)
    //cout<<a[i]<<" ";
    //cout<<"\n";
}
void Interclasare(int st, int dr)
{
    int i,j,ok=1,ct=0;
    i=1;
    j=st;
    while(i<=st-1||j<=dr)
    {   //if(ct<dr){
        if(a[i]<a[j]&&i<=st-1)
        {
            //cout<<a[i]<<" "<<i<<"\n";
            ct++;
            b[ct]=a[i];
            if(i<=st-1)i++;
        }
        else if(a[i]>a[j]&&j<=dr)
        {
            //cout<<a[j]<<" "<<j<<"\n";
            ct++;
            b[ct]=a[j];
            if(j<=dr)j++;
        }
        else if(i<=st-1)
        {
            //cout<<a[i]<<" "<<i<<"\n";
            ct++;
            b[ct]=a[i];
            if(i<st-1)i++;
        }
        else
        {
            //cout<<a[j]<<" "<<j<<"QQ"<<"\n";
            ct++;
            b[ct]=a[j];
            if(j<dr)j++;
        }//}
        if(ct==dr){//cout<<"AAA";
                break;}
    }
    for(i=1; i<=dr; i++)
        a[i]=b[i];
}
int main()
{
    int i,j,k;
    fin>>N;
    R=int(sqrt(double(N)));
    j=1;
    for(i=1; i<=N; i++)
    {
        fin>>a[i];
        if(i%R==0)
        {
            Sortare(j,i);
            if(i/R>1)Interclasare(j,i);
            j=i+1;
            //cout<<"\n";
        }
        else if(i==N)
        {
            Sortare(j,i);
            if(j>1)Interclasare(j,i);
        }
    }
    for(i=1; i<=N; i++)
        fout<<a[i]<<" ";
}