Advertisement
Paszta

Taco - pierwszy temat

Mar 24th, 2019
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.04 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstdlib>
  3.  
  4. //program z 1 tematu jakby ktos pytal
  5.  
  6. using namespace std;
  7.  
  8. bool generate_array_of_random_numbers(int* &arr, int n, int a, int b);
  9. void show_array(int* arr, int n);
  10. bool check_if_nondescending(int *arr, int n);
  11. int find_max_el(int *arr, int n);
  12. int sum_array(int *arr, int n);
  13. int mean_array(int *arr, int n);
  14.  
  15. int main()
  16. {
  17.     int n, a, b, start, max_step;
  18.     int *arr=nullptr;
  19.     cout << "podaj rozmiar tablicy" << endl;
  20.     cin >> n;
  21.     cout << "podaj poczatek przedzialu" << endl;
  22.     cin >> a;
  23.     cout << "podaj koniec przedzialu" << endl;
  24.     cin >> b;
  25.  
  26.     if(generate_array_of_random_numbers( arr, n, a, b)==1){
  27.             show_array( arr, n);
  28.             cout << "" << endl;
  29.     }
  30.     else {
  31.         cout << " niepoprawna tablica " << endl;
  32.     }
  33.  
  34.     cout<< "max element to: "<< find_max_el(arr, n)<< endl;
  35.     cout<< "suma wynosi: "<< sum_array(arr, n) << endl;
  36.     cout << "srednia wynosi: " << mean_array(arr, n)<< endl;
  37.  
  38.     return 0;
  39. }
  40. bool generate_array_of_random_numbers(int* &arr, int n, int a, int b){
  41.     if(arr == nullptr){
  42.     arr = new int[n];
  43. int diff = b-a+1;
  44. for( int i = 0; i<n; i++)
  45.     arr[i]=a+rand()%diff;
  46. return true;}
  47.     else{
  48. return false;
  49.     }
  50. }
  51.  
  52.  
  53. void show_array(int* arr, int n){
  54. for(int i=0; i<n; i++)
  55.     cout << arr[i] << " ";
  56. }
  57.  
  58. bool check_if_nondescending(int *arr, int n){
  59. if(arr == nullptr and n == 0)
  60.     return true;
  61. for(int i=0; i<n; i++)
  62.     if(arr[i]>arr[i+1])
  63.     return false;
  64. return true;
  65. }
  66.  
  67. int find_max_el(int *arr, int n){
  68. if(arr == nullptr or n == 0)
  69.     return -1;
  70. int maxel = arr[0];
  71. for (int i =0; i<n; i++)
  72. if(arr[i]> maxel){
  73.     maxel= arr[i];
  74. }
  75. return maxel;
  76. }
  77.  
  78. int sum_array(int *arr, int n){
  79. int suma = 0;
  80. if( arr != nullptr){
  81.             for(int i = 0; i<n; i++)
  82.         suma=suma+arr[i];}
  83. else{
  84.  suma = 0;
  85. }
  86. return suma;
  87. }
  88.  
  89. int mean_array(int *arr, int n){
  90. int z;
  91. int srednia;
  92. if( arr != nullptr){
  93. z = sum_array(arr, n);
  94. srednia = z/n;}
  95. else{
  96.     srednia = 0;
  97. }
  98. return srednia;
  99. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement