Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <string.h>
- #include <math.h>
- #include <stdlib.h>
- void quicksort(int n, int vet[n], int f, int l)
- {
- int pivot = f;
- int i = f;
- int j = l;
- int aux;
- while(i<j)
- {
- while(vet[i] <= vet[pivot] && i<l)
- i++;
- while(vet[j] > vet[pivot])
- j--;
- if(i<j)
- {
- aux = vet[i];
- vet[i] = vet[j];
- vet[i] = aux;
- }
- aux = vet[pivot];
- vet[pivot] = vet[j];
- vet[j] = aux;
- quicksort(n,vet,f,l-1);
- quicksort(n,vet,f+1,l);
- }
- }
- int main() {
- int n;
- scanf("%d", &n);
- int vet[n],i;
- for(i=0; i<n ;i++)
- {
- scanf("%d", &vet[i]);
- }
- for(i=0; i<n ;i++)
- {
- //printf("%d ",vet[i] );
- }
- quicksort(n,vet,0,n-1);
- for(i=0; i<n ;i++)
- {
- printf("%d ",vet[i] );
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement