#include<stdio.h>
//binomial coefficient function
double Ni(
int deg, //degree
int b //for binomial
)
{
if( deg < 0 )
return 0.0;
else if ( deg == 0 )
return 1.0;
else{
double temp = 1.0;
for(int i=1; i<=b;i++ ){
temp = temp* (double)(deg-i+1)/i;
printf("%f\n", temp);
}
return temp;
}
}
void main ()
{
int a=10, b=3;
double bin;
bin = Ni(a, b);
printf("\n=============\n");
printf("%f\n", bin);
}
binomial coefficient c code
Saturday, March 25, 2017
comparison of secant and bisection method
#include<stdio.h>
#include<math.h>
#include<time.h>
//example of function f(t), you can make any function you like
float f(float t)
{
return(((48.2291-30.6208*t-43) * (48.2291-30.6208*t-43)) + 35*t - 25.0);
}
void main()
{
float a = 0.1, b = 0.3, c = 0, e = 7.5e-3;
//a, b interval
//e error
int count = 1, n = 50; //n=maximum iteration
//
//secant
//
clock_t begin = clock();
do
{
c = (a*f(b) - b*f(a)) / (f(b) - f(a));
//c = b - (f(b)*(b-a) / (f(b) - f(a)));
a=b;
b=c;
printf("i No-%d t=%f d=%f\n",count,c, f(c));
count++;
if(count==n) break;
} while(fabs(f(c))>e);
clock_t end = clock();
double time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf("time:%f", time_spent);
printf("\nThe required solution is %f\n",c);
printf("d = %f\n", f(c) + 25);
//
//bisection
//
double fa, fb, fc;
a = 0.1; b = 0.3; c = 0; e = 7.5e-3;
count = 1;
clock_t begin2 = clock();
do{
c = (a+b)/2;
fa = f(a);
fb = f(b);
fc = f(c);
if(fa*fc < 0){
b = c;
}
else{
a = c;
}
printf("i No-%d t=%f d=%f\n", count, c, fc);
count++;
if(count==n) break;
} while(fabs(fc)>e);
clock_t end2 = clock();
double time_spent2 = (double)(end2 - begin2) / CLOCKS_PER_SEC;
printf("time:%f", time_spent2);
printf("\nThe required solution is %f\n",c);
printf("d = %f\n", fc + 25);
}
Subscribe to:
Posts (Atom)