Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void sortiraj(float* niz, int duzina)
- {
- int i,j;
- for (i=0; i<duzina-1; i++)
- for (j=i+1; j<duzina; j++)
- if (niz[i] < niz [j])
- {
- float temp = niz[i];
- niz[i]= niz[j];
- niz[j]= temp;
- }
- }
- int pronadjimaksimum (int niz[], int vel)
- {
- int max = niz[0], i;
- for (i = 0; i < vel; i++)
- if (niz[i] > max)
- max = niz[i];
- return max;
- }
- int pronadjiminimum (int niz[], int vel)
- {
- int min=niz[0], i;
- for (i=0; i< vel; i++)
- if (niz[i]<min)
- min=niz[i];
- return min;
- }
- int main()
- {
- int i, n;
- int min, max;
- printf ("Unesite koliko zelite da clanova ima niz:\n");
- scanf ("%d", &n);
- float niz[n];
- printf ("Unesite clanove niza:");
- for (i=0; i<n; i++)
- {
- scanf ("%f", &niz[i]);
- }
- sortiraj(niz, n);
- printf ("Sortiran niz je: \n ");
- for (i=0; i<n; i++)
- printf ("%.f" , niz[i] );
- int maxi=pronadjimaksimum(niz,max);
- printf(" Maksimum niza je: %d", maxi);
- int mini= pronadjiminimum(niz,min);
- printf("Minimum niza je: %d", mini);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment