#include <iostream>
#include <conio.h>
using namespace std;
int massiv[100000];
void quicksort (int a,int b)
{ int i,j;
int p, temp;
i=b;
j=a;
p=massiv[(a+b)/2];
do
{
while (massiv[i]<p) i++;
while (massiv[j]>p) j--;
if (i<=j)
{ temp=massiv[i];
massiv[i]=massiv[j];
massiv[j]=temp;
i++; j--;
}
}
while (i<=j);
if(j>b) quicksort(j,b);
if(a>i) quicksort(a,i);
}
int main()
{
int size; int i;
cout<<"Andijon = "; cin>>size;
cout<<"Buxoro = "; cin>>size;
cout<<"Farg`ona = "; cin>>size;
cout<<"Jizzax = "; cin>>size;
cout<<"Xorazm = "; cin>>size;
cout<<"Namangan = "; cin>>size;
cout<<"Navoiy = "; cin>>size;
cout<<"Qashqadaryo = "; cin>>size;
cout<<"Qoraqalpog`iston = "; cin>>size;
cout<<"Samarqand = "; cin>>size;
cout<<"Sirdaryo = "; cin>>size;
cout<<"Surxondaryo = "; cin>>size;
cout<<"Toshkent viloyati = "; cin>>size;
/*for (i=0; i<size; i++)
cin>>massiv[i];
quicksort(size-1,0);
for(i=0; i<size; i++)
cout<<massiv[i]<<" ";*/
quicksort(size-1,0);
cout<<size<<endl;
getch();
return 0;
}
//
Fil de discussion#include <iostream>
4 messages · –N C