Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int T[2000001];
- int l, r;
- int podziel(int T[],int l,int r)
- {
- int pivot= l+(r-l)/2;
- int w=T[pivot];
- swap(T[pivot], T[r]);
- int a=l;
- for(int i=l; i<r-1; i++){
- if(T[i]<w){
- swap(T[i],T[a]);
- a++;
- }
- }
- swap(T[a],T[r]);
- return a;
- }
- void quicksort(int T[],int l,int r){
- int i;
- if(l<r){
- i=podziel(T, l, r);
- quicksort(T, l, i-1);
- quicksort(T, i+1, r);
- }
- }
- int main(){
- int b;
- cin >> b;
- for(int i=0; i<b; i++){
- cin >> T[i];
- }
- quicksort(T, 0, b-1);
- for(int i=0; i<b; i++){
- cout << T[i] << " ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement