Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int A[20000],N;
- void Olvas()
- {
- ifstream f("sokszam.in");
- f>>N;
- for(int i=0;i<=N-1;i++)
- {
- f>>A[i];
- }
- f.close();
- }
- void Csere(int &a,int &b)
- {
- int s=a;
- a=b;
- b=s;
- }
- void QuickSort(int e,int u)
- {
- int elol=1,i=e,j=u;
- while(i<j)
- {
- if (A[i]>A[j])
- {
- Csere(A[i],A[j]);
- elol=1-elol;
- }
- if(elol)
- j--;
- else
- j++;
- }
- if((i-e)>1)
- QuickSort(e,i-1);
- if((u-1)>1)
- QuickSort(i+1,u);
- }
- void Kiir()
- {
- ofstream g("sokszam.out");
- for(int i=0;i<=N-1;i++)
- g<<A[i]<<" ";
- g.close();
- }
- int main()
- {
- Olvas();
- QuickSort(0,N-1);
- Kiir();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement