اذهب إلى المحتوى

Ahmed Ali Ali

الأعضاء
  • المساهمات

    1
  • تاريخ الانضمام

  • تاريخ آخر زيارة

إنجازات Ahmed Ali Ali

عضو مبتدئ

عضو مبتدئ (1/3)

0

السمعة بالموقع

  1. #include <iostream> using namespace std; int sum_1D(int arr-1D [ ], int n) { int sum-1D = 0; for(int i = 0; i<n ; i++) sum_1D = sum_1D + arr_1D [i]; return sum_1D; } int sum_2D (int m, int n, int arr_2D [4] [4]) { int sum_2D = 0; for(int i= 0; i<m; i++) for(int j= 0; j<n; j++) sum_2D = sum_2D+arr_2D [i] [j]; return sum_2D; } int max_1D(int n,int arr_1D [4]) { max_num = arr_1D [0]; min_num = arr_1D [0]; for(int i=0; i<n; i++) { { min_num = arr_1D [0] for(int i= 0; i<n; i++) { if(arr_1D [i]>max_num) max_num = arr_1D [i]; if(arr_1D [i]<min_num) min_num = arr_1D [i]; return max_num; } int min_1D (int n, int arr_1D[4]) { min_num = arr_1D [0]; for(int i = 0; i<n; i++) if(arr_1D [i]<min_num) min_num = arr_1D [i]; return min_num; } int max_2D(int m, int n ,int arr_2D[4] [4]) { max_num = arr_2D[0] [0]; for(int i= 0; i<m ; i++) for(int j= 0;j<n; j++) if(arr_2D [i] [j] >max_num) max_num = arr_2D[i] [j]; return max_num; } int min_2D(int m ,int n, int arr_2D[0] [0]) { min_num= arr_2D[4] [4]; for(int i=0; i<m; i++) for(int j=0; j<n; j++) if(arr_2D [i] [j]<min_num) min_num= arr_2D [i] [j]; return min_num; } int main() { int Arr_1D [4] = {4,1,2,3}; int Arr_2D [4] [4] = {6,8,-1,-10},{43,3,5,11},{2,7,8,13},{33,23,4,9}; cout<<"the sum of 1D array is:"<<sum_1D(4,Arr_1D)<<endl; cout<<"the sum of 2D array is:"<<sum_2D(4, 4, Arr_2D)<<endl; cout<<"the max_num number of 1D array is:"<<max_1D(4,Arr_1D)<<endl; cout<<"the min_num number of 1D array is:"<<min_1D(4, Arr_1D)<<endl; cout<<"the max_num number of 2D array is:"<<max_2D(4, 4, Arr_2D)<<endl; cout<<"the min_num number of 2D array is:"<<min_2D(4,4,Arr_2D)<<endl; return 0; }
×
×
  • أضف...