Guest User

Untitled

a guest
Jun 24th, 2018
85
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. #include "fce.h"
  2. void mypause()
  3. {
  4. printf("Press ENTER....");
  5. getchar();
  6. }
  7. double fact(double n)
  8. {
  9. n=n-1;
  10. if (n>0)
  11. {
  12. return (n+1)*fact(n);
  13. }
  14. return 1;
  15. }
  16. int fibonacci(int n)
  17. {
  18. int fib,a=0,b=1,d;
  19. for(d=0;d<n;d++)
  20. {
  21. fib=a+b;
  22. a=b;
  23. b=fib;
  24. }
  25. return fib;
  26. }
  27. int get_min(int pole[], int delka)
  28. {
  29. int a,minimum;
  30. for(a=0;a<delka;a++)
  31. {
  32. if(a=0)minimum=pole[a];
  33. if(minimum>pole[a])
  34. {
  35. minimum=pole[a];
  36. }
  37. return minimum;
  38. }
  39. }
  40. void minimax(int pole[], int delka)
  41. {
  42. printf("Minimum=%d,maximum=%d",get_min(pole,delka),get_max(pole,delka));
  43. }
  44. int get_max(int pole[], int delka)
  45. {
  46. int a,maximum;
  47. maximum=pole[0];
  48. for(a=1;a<delka;a++)
  49. {
  50. if(maximum<pole[a])
  51. {
  52.  
  53. maximum=pole[a];
  54. }
  55. }
  56. return maximum;
  57. }
Add Comment
Please, Sign In to add comment