Advertisement
dllbridge

Untitled

Feb 26th, 2025
230
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 2.31 KB | None | 0 0
  1.  
  2. #include  <stdio.h>
  3. #include <stdlib.h>
  4. #include   <time.h>
  5.  
  6.  
  7. int size = 20;
  8.  
  9.  
  10. int max_indx(int arr[]);
  11.  
  12. int minnumber_calculation (int arr[], int size);  
  13.  
  14. void printarray (int arr[], int size);  
  15.  
  16.  
  17. ///////////////////////////////////////////////////////////////////
  18. int main()
  19. {
  20.    
  21.     int numbers[31] = { 0,  1,  3, 4, 5, 6, 7, 8, 9,
  22.                        10, 11, 12,13,14,15,16,17,18,19};
  23.    
  24.    
  25.   //  printf(" time(0) = %d\n", time(0) );
  26.      
  27.     srand(time(0));
  28.      
  29.     for(int i = 0; i < 20; i++)
  30.     {
  31.            
  32.         numbers[i] = rand() % 200;
  33.     }                  
  34.  
  35.     int calc = max_indx(numbers );
  36.     int calc_min = minnumber_calculation (numbers, size);
  37.  
  38.     printf ("The array was: ");
  39.     printarray(numbers, size);
  40.     printf ("\n Number of array elements is : %d\n",              size);
  41.     printf ("\n First Element of array is : %d  \n",        numbers[0]);
  42.     printf ("\n Last Element of array is : %d   \n", numbers[size - 1]);
  43.     printf("__________________________________\n");
  44.     printf("\n Maximal number of array is: %d\n Minimal number of array is: %d\n__________________________________",calc, calc_min);
  45.     printf("\n Maximal number adress is :%p", &calc);
  46.     printf("\n Minimal number adress is :%p", &calc_min);
  47.  
  48. return 0;
  49. }
  50.  
  51.  
  52.  
  53.    
  54. // functions
  55. /////////////////////////////////////////////////////////////////
  56. void printarray (int arr[], int size)                          //
  57. {
  58.      
  59.      for(int i = 0; i < size; i++)
  60.      {
  61.          printf("%d | ", arr[i]);
  62.      }
  63.  
  64.      printf ("\n");
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71. /////////////////////////////////////////////////////////////////
  72. int max_indx(int arr[])                                        //
  73. {
  74.    
  75.     int max_value = arr[0];
  76.    
  77.     for(int i = 1; i < size; i++)
  78.     {
  79.         if(arr[i] > max_value)
  80.         {
  81.             max_value = arr[i];
  82.         }
  83.     }
  84.    
  85. return max_value;
  86. }
  87.  
  88.  
  89.  
  90.  
  91. ///////////////////////////////////////////////////////////////////
  92. int minnumber_calculation (int arr[], int size)                  //  
  93. {
  94.         int min_value = arr [0];
  95.  
  96.             for (int i = 1; i < size; i++)
  97.         {
  98.  
  99.                 if (arr[i] < min_value)
  100.                 {
  101.                 min_value = arr [i];
  102.                 }
  103.         }
  104.  
  105. return min_value;
  106. }
  107.  
  108.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement