Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- using namespace std;
- #define M 1000000
- int data[M+5];
- int partition(int *arr , int start , int end ){
- int pivot = arr[end];
- int p_index = start;
- int i , t;
- for(i = start; i < end ; i++)
- {
- if(arr[i] <= pivot)
- {
- t= arr[i] ;
- arr[i] = arr[p_index] ;
- arr[p_index] = t;
- p_index++;
- }
- }
- t= arr[end] ;
- arr[i] = arr[p_index] ;
- arr[p_index] = t ;
- return p_index;
- }
- void quicksort(int *A ,int start , int end){
- if(start < end){
- int p_index = partition(A,start,end);
- quicksort(A,start,p_index-1);
- quicksort(A,p_index+1,end);
- }
- }
- int main(){
- // freopen("in.txt","r",stdin);
- // freopen("out.txt","w",stdout);
- int tc ,i , k;
- cout<< "how many elements \n";
- scanf("%d",&tc);
- cout << "enter " << tc << " elements\n";
- for(i = 1 ; i<= tc ;i++)
- scanf("%d",&data[i]);
- quicksort(data,1, tc);
- cout<< "Sorted list \n";
- for(i = 1 ; i<= tc ;i++)
- printf("%d ",data[i]);
- return 0;}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement