Pagini recente » Cod sursa (job #868243) | Cod sursa (job #2903999) | Cod sursa (job #2530886) | Cod sursa (job #606458) | Cod sursa (job #515708)
Cod sursa(job #515708)
#include<iostream>
#include<stdio.h>
using namespace std;
void Quick(int* t,int st,int dr) //Sortarea rapida (!)
{ int i=st,j=dr,w,piv=t[(i+j)/2];
do {
while(t[i] < piv) i++;
while(t[j] > piv) j--;
if(i <= j) {w=t[i]; t[i]=t[j]; t[j]=w; i++; j--;}
}
while(j >= i);
if(st < j) Quick(t,st,j);
if(dr > i) Quick(t,i,dr);
}
int i,v[500001],n;
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
cin>>n;
for(i=1;i<=n;i++)
{
cout<<"v["<<i<<"]=";
cin>>v[i];
}
Quick(v,1,n);
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
cin>>i;
}