Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int partitionn(int arr[100],int p,int q);
- void quicksort(int arr[100],int p,int q);
- int main()
- {
- int p,q,n,i,arr[100];
- cin>>n;
- for(i=0;i<n;i++)
- {
- cin>>arr[i];
- }
- quicksort(arr,0,n-1);
- for(i=0;i<n;i++)
- {
- cout<<arr[i]<<endl;
- }
- }
- void quicksort(int arr[],int p,int q)
- {
- int i,n;
- if(p<q)
- {
- int k=partitionn(arr,p,q);
- quicksort(arr,p,k-1);
- quicksort(arr,k+1,q);
- }
- }
- int partitionn(int arr[],int p,int q)
- {
- int i=0,j,n,pivot=0;
- i=p;
- pivot=arr[p];
- for(j=p+1;j<=q;j++)
- {
- if(arr[j]<=pivot)
- {
- swap(arr[i],arr[j]);
- i++;
- }
- }
- swap(arr[i],pivot);
- return i;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement