Skip to main content

simpson's 1/3 rule


 ///Bismillahir Rahmanir Rahim
///Author:Tanvir Ahmmad
///Dept.CSE,IU,Bangladesh




#include<iostream>
using namespace std;

int main()
{

    double up,low,h,arr_y[1009],sum=0;
    cout<<"Given function f(x)=1/(1+X)"<<endl<<"Given the upper limit of integration : ";
    cin>>up;
    cout<<"Given the lower limit of integration : ";
    cin>>low;
    cout<<"Given the value of h : ";
    cin>>h;
    int n=(up-low)/h;
    cout<<"So the value of n = "<<n<<endl;
    for(int i=0; i<=n; i++)
    {
        arr_y[i]=(1.0/(1.0+(i*h)));
        if(i==0) cout<<"X=X0        Y["<<i<<"]="<<arr_y[i]<<endl;
        else cout<<"X=X0+"<<i<<"h"<<"     Y["<<i<<"]="<<arr_y[i]<<endl;
    }
    for(int i=1;i<n;i++)
    {
        if(i%2==1)  sum+=(4*arr_y[i]);
        else sum+=(2*arr_y[i]);
    }
    sum+=(arr_y[0]+arr_y[n]);
    cout<<"Required value of integration is: "<<(sum*h)/3.0<<endl;
    return 0;

}



///Alhamdulillah


Labels:

Comments

Post a Comment

Popular posts from this blog

Codeforces round 1661(B. Getting Zero)

using   second operation  the answer is maximum is  15  because  2 15 =32768 so we need to  pre-calculate all the illegible input 0 to 32768   using  second operation Then  just increment 1(using first operation)  from input check is it  minimum is not ! ///Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int...
Post a Comment
Read more

Codeforces round 1676(A. Lucky?)

Just count the  first three  &  last three  number ///Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is repres...
Post a Comment
Read more

Codeforces Round #282 (Div. 2) (B. Modular Equations)

Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b using   namespace  std; typedef   long   long ...
Post a Comment
Read more