3-labaratoriya ishi 17-variant o`lmasov Nurbek Raqamli axborotlarni qayta ishlashda Fure usuli va dinamik dasturlash yo‘li

Dinamik dasturlashdan foydalanmasdan rekursiv funksiya orqali ishlangan dastur:
#include
#include
using namespace std;
int fib(int n){
if(n<=1) return n;
else return fib(n-1)+fib(n-2);
}
int main(){
cout<<"CAL007-L1guruhi O`lmasov Nurbek"<
for(int n=1; n<45; n++){
clock_t time1 = clock();
int result = fib(n);
clock_t time2 = clock();
int d = (time2-time1)*1000/CLOCKS_PER_SEC;
cout<<"fib("<
}
cout<<"CAL007-L1 guruhi O`lmasov Nurbek"<
return 0;
}


Dinamik dasturlashdan foydalanib (Tepadan pastga) ishlangan dastur:
#include
#include
using namespace std;
int cache[50] = {0};
int fib(int n){
if(n<=1) return n;
if (cache [n] == 0)
cache [n] = fib(n-1)+fib(n-2);
return cache[n];
}
int main(){
for(int n=1; n<45; n++){
clock_t time1 = clock();
int result = fib(n);
clock_t time2 = clock();
int d = (time2-time1)*1000/CLOCKS_PER_SEC;
cout<<"fib("<
}
cout<<"CAL007-L1 guruhi O`lmasov Nurbek"<
return 0;
}

Dinamik dasturlashdan foydalanib (Pastdan tepaga) ishlangan dastur:

#include
#include
using namespace std;
int fib1(int n){
int F[n+1];
F[0]=0;
F[1]=1;
for(int i=2; i<=n; i++)
F[i]=F[i-1]+F[i-2];
return F[n];
}
int main(){
for(int n=1; n<45; n++){
clock_t time1 = clock();
int result = fib1(n);
clock_t time2 = clock();
int d = (time2-time1)*1000/CLOCKS_PER_SEC;
cout<<"fib("<
}
cout<<"CAL007-L1guruhi O`lmasov Nurbek"<
return 0;
}

3-vazifa
Jadval ko'rinishida berilgan funksiyalar uchun eng kichik kvadratlar usulini qo'llab berilgan qiymatlarga yaqinlashuvchi chiziqli bog'lanishni toping, analitikva grafik usulda ifodalang (excelda va biror dasturlash tilida)
3-vazifaga doir variantlar:



#include
#include
#include
#include
using namespace std;
int main()
{
int i,j,k,n;
cout<<"\nparametirlar soni nechta bulsin:\n";
cin>>n;
double x[n],y[n],a,b;
cout<<"\nx qiymatlarini kiriting:\n";
for (i=0;i
cin>>x[i];
cout<<"\ny qiymatlarini kiriting:\n";
for (i=0;i
cin>>y[i];
double xsum=0,x2sum=0,ysum=0,xysum=0;
for (i=0;i
{
xsum=xsum+x[i];
ysum=ysum+y[i];
x2sum=x2sum+pow(x[i],2);
xysum=xysum+x[i]*y[i];
}
a=(n*xysum-xsum*ysum)/(n*x2sum-xsum*xsum);
b=(x2sum*ysum-xsum*xysum)/(x2sum*n-xsum*xsum);
double y_fit[n];
for (i=0;i
y_fit[i]=a*x[i]+b;
cout<<"S.no"<
cout<<"-----------------------------------------------------------------\n";
for (i=0;i
cout<
cout<<"\nCHIZIQLI TENGLAMA KURINISHI :\n\n"<<"Y="<
float d[n],d_2[n];
for(int i=0;i
{
d[i] = (a*x[i]+b) - y[i];
d_2[i] = d[i]*d[i];
cout<
}
double Sum,Sum2 ;
for(int i=0;i
{
Sum=(y_fit[i]-y[i])*(y_fit[i]-y[i]);
cout<<"natija "<
Sum2=Sum+Sum2;
Sum=0;
}
cout<<" summa yigindisi"<

}