Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <math.h>
- void quicksort(int tab[],int x,int y)
- {
- int i=x,j=y,temp=0;
- int piv=tab[(x+y)/2];
- do{
- while(tab[i]<piv)
- i++;
- while(tab[j]>piv)
- j--;
- if(i<=j){
- temp=tab[i];
- tab[i]=tab[y];
- tab[y]=temp;
- i++;
- j--;
- }
- }while(i <= j);
- if(x<j) quicksort(tab, x, j);
- if(y>i) quicksort(tab, i, y);
- }
- int main()
- {
- int i,j;
- int *tab;
- printf("Ile liczb chcesz sortowac: \n");
- scanf("%i",&j);
- tab = (int *)malloc(j * sizeof(int*));
- printf("Podaj swoje liczby: ");
- for(i=0;i<j;i++){
- scanf("%i",&tab[j]);
- }
- printf("oto liczby przed sortowaniem: %i",&tab[j]);
- for(i=0;i<j;i++){
- printf("%i",&tab[j]);
- }
- quicksort(tab,0,j-1);
- printf("Po sortowaniu: %i",&tab[j]);
- for(i=0;i<j;i++){
- printf("%i",&tab[j]);
- }
- getchar();
- free(tab);
- getchar();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement