Ikki o’lchamli kvadrat matritsa berilgan. Uning har bir satridagi eng katta elementlarini aniqlash dasturini tuzing

1-masala.
Ikki o’lchamli kvadrat matritsa berilgan. Uning har bir satridagi eng katta elementlarini aniqlash dasturini tuzing.

#include

using namespace std;

int maxNum(int arr[]){
int m = arr[0];
for(int i=0;i<4;i++){
if(m < arr[i]){
m = arr[i];
}
}
return m;
}


int main(){
int a[4][4];
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
cin >> a[i][j];
}
cout << endl;
}

for(int i=0;i<4;i++){

cout << i+1 << "-qatorning eng katta qiymati: "
<< maxNum(a[i]) << "\n";
}
}



2-masala.
Quyidagi funksiyani to’rtburchaklar, Trapetsiya va Simpson formulalari yordamida taqribiy hisoblash dasturini tuzing

#include

#include
using namespace std;
double f(double x)
{
return sin(x)/(1 + x*x);
}
int main()
{
int i;
double Integral;
double a = 0.0, b = 1.0;
double h = 0.1;
double n;
n = (b - a) / h;
Integral = 0.0;
for(i = 1; i <= n; i++)
Integral = Integral + h * f(a + h * (i - 0.5));
cout << "I1 = " << Integral << "\n";
Integral = h * (f(a) + f(b)) / 2.0;
for(i = 1; i <= n-1; i++)
Integral = Integral + h * f(a + h * i);
cout << "I2 = " << Integral << "\n";
Integral = h * (f(a) + f(b)) / 6.0;
for(i = 1; i <= n; i++)
Integral = Integral + 4.0 / 6.0 * h * f(a + h * (i - 0.5));
for(i = 1; i <= n-1; i++)
Integral = Integral + 2.0 / 6.0 * h * f(a + h * i);
cout << "I3 = " << Integral << "\n";

system("pause");

}