Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void sort(int n, int x[], int k);
- int main()
- {
- int n, x[41], i, k;
- printf("Unesite n: ");
- scanf("%d",&n);
- printf("Unesite niz\n");
- for(i=0;i<n;i++) x[i]=0;
- for(i=0;i<n;i++)
- {
- printf("X[%d]=",i+1);
- scanf("%d",&x[i]);
- }
- do{
- printf("\nSortiranje po rastucem (1) ili opadajucem (2): ");
- scanf("%d",&k);
- }while(k!=1 && k!=2);
- sort(n,x,k);
- printf("\nNovi niz x: ");
- for(i=0;i<n;i++) printf("%d ",x[i]);
- return 0;
- }
- void sort(int n, int x[], int k)
- {
- int imin,temp,j,i;
- if(k==1)
- {
- for(i=0;i<n-1;i++)
- {
- imin=i;
- for(j=i+1;j<n;j++) if(x[j]<x[imin]) imin=j;
- if(i!=imin)
- {
- temp=x[i];
- x[i]=x[imin];
- x[imin]=temp;
- }
- }
- }
- else
- {
- for(i=0;i<n-1;i++)
- {
- imin=i;
- for(j=i+1;j<n;j++) if(x[j]>x[imin]) imin=j;
- if(i!=imin)
- {
- temp=x[i];
- x[i]=x[imin];
- x[imin]=temp;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement