Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int position(int[], int, int);
- void quicksort(int[], int, int);
- int main()
- {
- int n;
- cout<<"n="; cin>>n;
- int v[n];
- cout<<"Introdu elementele vectorului:"<<endl;
- for (int i=0; i<n; i++)
- cin>>v[i];
- quicksort(v,0, n-1);
- cout<<"Vectorul sortat este:"<<endl;
- for (int i=0; i<n; i++)
- cout<<v[i]<<" ";
- return 0;
- }
- int position (int v[],int stg, int dr){
- int piv=v[stg];
- while (stg<dr){
- if (v[stg]>v[dr])
- swap (v[stg++], v[dr]);
- else
- dr--;
- }
- return stg;
- }
- void quicksort (int v[], int stg, int dr){
- if (stg<dr){
- quicksort(v, stg, position(v, stg, dr)-1);
- quicksort(v, position(v, stg, dr)+1, dr);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement