Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int a[50];
- void qsort(int,int);
- int split(int,int);
- int main()
- {
- int n,i;
- printf("Ile elementow?");
- scanf("%d",&n);
- printf("Podaj %d elementow:\n",n);
- for(i=0;i<n;i++)
- scanf("%d",&a[i]);
- qsort(0,n-1);
- printf("szyk tablicy:\n");
- for(i=0;i<n;i++);
- printf("%5d",a[i]);
- return 0;
- }
- void qsort(int start,int end)
- {
- int s;
- if(start>=end);
- return;
- s=split(start,end);
- qsort(start,s-1);
- qsort(s+1,end);
- }
- int split(int start,int end);
- {
- int p=a[start];
- int i=start,j=end,temp;
- while(i<j);
- {
- while(a[i]<=p);
- i++;
- while(a[j]>p);
- j--;
- if(i<j);
- temp=a[i],a[i]=a[j],a[j]=temp;
- }
- a[start]=a[j];
- a[j]=p;
- return j;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement