-
Notifications
You must be signed in to change notification settings - Fork 0
/
55-2d-array.cpp
106 lines (81 loc) · 2.42 KB
/
55-2d-array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include <iostream>
using namespace std;
// for searching in 2d:
bool isPresent(int x, int arr[][4], int row, int col){
for (int i = 0; i < row; i++){
for (int j = 0; j < col; j++){
if (x == arr[i][j]) return true;
}
}
return false;
}
int findMax(int arr[][4], int row, int col) {
int mxNum = arr[1][1];
for (int i = 0; i < row; i++){
for(int j = 0; j < col; j++){
if(arr[i][j] > mxNum) mxNum = arr[i][j];
}
}
return mxNum;
}
int findMin(int arr[][4], int row, int col) {
int miNum = arr[1][1];
for (int i = 0; i < row; i++){
for(int j = 0; j < col; j++){
if(arr[i][j] < miNum) miNum = arr[i][j];
}
}
return miNum;
}
void rowWiseSum(int arr[][4], int row, int col){
for (int i=0;i<row;i++){
int sum = 0;
for(int j=0;j<col;j++){
sum += arr[i][j];
}
cout << "Sum of row-" << i << " is: " << sum << endl;
}
return;
}
void columnWiseSum(int arr[][4], int row, int col){
for (int i=0;i<col;i++){
int sum = 0;
for(int j=0;j<row;j++){
sum += arr[j][i];
}
cout << "Sum of column-" << i << " is: " << sum << endl;
}
return;
}
int Transpose(int arr[][4], int row, int col){
for(int i=0; i<row;i++){
for(int j=i+1;j<col;j++){
swap(arr[i][j],arr[j][i]);
}
}
for (int i = 0; i < 3; i++) {for (int j = 0; j < 4; j++) cout << arr[i][j]<< " "; cout << endl;}
}
int main(){
// atleast number of columns shoud be specified.
// specifying number of rows is optional
// when passing a 2d array to a function, also pass column count.
int arr[3][4] = {
{10,20,30,40},
{100,200,300,400},
{3,6,9,12}
};
for (int i = 0; i < 3; i++) {for (int j = 0; j < 4; j++) cout << arr[i][j]<< " "; cout << endl;}
int z;
cout << "enter element to find: "; cin >> z;
isPresent(z, arr,3, 4) ? cout << "Found." : cout << "Not found.";
cout << endl;
cout << "Max number present: " << findMax(arr,3,4) << endl;
cout << "Min number present: " << findMin(arr,3,4) << endl;
cout << "Row-wise sum: \n";
rowWiseSum(arr, 3, 4);
cout << "Column-wise sum: \n";
columnWiseSum(arr, 3, 4);
int brr[][4] = {{15,30,45},{20,40,60},{25,50,75}};
Transpose(brr,3,4);
return 0;
}