avukas

drugi maximum

Jan 25th, 2014
130
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. int drugimax(int niz[], int vel)
  4. {
  5. int i, max, maxi, dmax, dmaxi;
  6. if (vel<2) {return 0; }
  7. max=niz[0];
  8. maxi=0;
  9. dmax=niz[1];
  10. dmaxi=1;
  11. for (i=1; i<vel; i++)
  12. {
  13. if (niz[i]>max)
  14. {
  15. dmax=max;
  16. maxi=i;
  17. max=niz[i];
  18. maxi=i;
  19. }
  20. else if (niz[i]>dmax)
  21. {
  22. dmax=niz[i];
  23. dmaxi=i;
  24. }
  25. }
  26. return dmaxi;
  27. }
  28.  
  29.  
  30. int main()
  31. {
  32. int n, i;
  33. printf("Koliko clanova?:\n");
  34. scanf("%d", &n);
  35. int niz[n];
  36. printf("Unesi clanove niza:\n");
  37. for (i=0; i<n; i++)
  38. {
  39. scanf("%d", &niz[i]);
  40.  
  41. }
  42. int maxi=drugimax(niz, n);
  43. printf("Rezultat lalala svega je: %d", maxi);
  44. return 0;
  45.  
  46. }
Advertisement
Add Comment
Please, Sign In to add comment