Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdlib>
- #include <ctime>
- using namespace std;
- void quicksort(int tab[],int x, int y)
- {
- int i=x,j=y,v=tab[x];
- do
- {
- while(v<tab[i])
- i++;
- while(v>tab[j])
- j--;
- if(i<=j)
- {
- swap(tab[i],tab[j]);
- i++;
- j--;
- }
- }
- while(i<=j);
- if(x<j)
- quicksort(tab,x,j);
- if(i<y)
- quicksort(tab,i,y);
- }
- int main()
- {
- srand(time(NULL));
- int n;
- cin>>n;
- int tab[n];
- for(int i=0;i<n;i++)
- {
- tab[i]=rand()%101;
- cout<<tab[i]<<endl;
- }
- cout<<endl;
- quicksort(tab,0,n-1);
- for(int i=0;i<n;i++)
- cout<<tab[i]<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement