Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int drugimax(int niz[], int vel)
- {
- int i, max, maxi, dmax, dmaxi;
- if (vel<2) {return 0; }
- max=niz[0];
- maxi=0;
- dmax=niz[1];
- dmaxi=1;
- for (i=1; i<vel; i++)
- {
- if (niz[i]>max)
- {
- dmax=max;
- maxi=i;
- max=niz[i];
- maxi=i;
- }
- else if (niz[i]>dmax)
- {
- dmax=niz[i];
- dmaxi=i;
- }
- }
- return dmaxi;
- }
- int main()
- {
- int n, i;
- printf("Koliko clanova?:\n");
- scanf("%d", &n);
- int niz[n];
- printf("Unesi clanove niza:\n");
- for (i=0; i<n; i++)
- {
- scanf("%d", &niz[i]);
- }
- int maxi=drugimax(niz, n);
- printf("Rezultat lalala svega je: %d", maxi);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment