Using namespace std; float min element(float arr[], int n){

1. 
   
   

#include

using namespace std;

float min_element(float arr[], int n){

float min = arr[0];

for (int i=1; i

if(min>arr[i]){

min = arr[i];

}

}

return min;

}

float find_back(float arr[], int n){

float back = arr[n-1];

return back;

}

int main () {

int n;

cout<<"Massiv o'lchovini kiriting: ";

cin>>n;

cout<

float arr[n];

for(int i=0; i

cin>>arr[i];

}

float res = min_element(arr, n) - find_back(arr, n);

cout<<"\nMassivning minimum elementi va oxirgi elementi orasidagi farq: "<

return 0;

}

2. 
   
   

#include

#include

using namespace std;

int fact(int fac){

int factorial=1;

for (int i=1; i<=fac; i++) {

factorial=factorial*i;

}

return factorial;

}

int main() {

int x;

cout<<"x ing qiymatini kiriting: ";

cin>>x;

int n;

cout<<"n ning qiymatini kiriting: ";

cin>>n;

double Q=0;

for(int i=1; i<=n; i++){

Q+=pow(x,(2*i-1))/fact(2*i-1);

}

cout<<"\nNatija: "<

return 0;

}

3. 
   
   

#include

using namespace std;

int getmax(int d[], int n){

int i=1, max = d[0];

while(i

if(max

max=d[i];

}

i++;

}

return max;

}

int main () {

int n;

cout<<"n ning qiymatini kiriting: ";

cin>>n;

int d[n];

int i=0;

while(i

cin>>d[i];

i++;

}

float S=0; int j=0;

while(j

S+=d[j];

j++;

}

double Q = (S/n)+getmax(d, n);

cout<<"Natija: "<
}

4. 
   
   

#include

#include

using namespace std;

int fact(int fac){

int factorial=1;

for (int i=1; i<=fac; i++) {

factorial=factorial*i;

}

return factorial;

}

float res(int x, int n){

double Q=0;

for(int i=1; i<=n; i++){

Q+=pow(x,(2*i-1))/fact(2*i-1);

}

return Q;

}

int main() {

int x;

cout<<"x ing qiymatini kiriting: ";

cin>>x;

int n;

cout<<"n ning qiymatini kiriting: ";

cin>>n;

cout<<"\nNatija: "< return 0;

}