Math Preperation Zone: Program Codes and Algorithms

Spoiler:

Code:


*****
=========================
Simple Trapezoidal Rule Algorithm to determine integration of a given function F(x)
=========================
*****


1. Determine the lower limit a and upper limit b of integration
2. Determine the segmetation width h
3. Calculate the number of segmentations n = (b-a)/h
4. Determine the initial value of sum as ( F(a) + F(b) )/2.0
5. Calculate sum = sum + F( a + i*h ), set i=i+1
6. If i<=n-1; go back to Step 5
7. Set ict = sum * h
8. Write the value of ict as integration result
9. Stop

Alternative approach (from step 5):
5. For i=1,2...n-1
 i. set sum = sum + F(a + i*h)
Repeat i
6. set ict = sum * h;
7. Write the value of ict as integration result
8. Stop.




Code:


/*
Differentiating continuous equations
code by Amit
*/
#include<math.h>

 
#include<stdio.h>

 
double sinv, sindiff, value=0, h=.031416;

 
double differ() {

    if (value==0) {

        return ((sin(value+h)-sin(value))/h);

    } else if (value==3.1416) {

        return ((sin(value)-sin(value-h))/h);

    } else {

        return ((sin(value+h)-sin(value-h))/(2*h));

    }

}

 
int main(void){

 
    int i;

 
    printf("\"X\",\"SinX\",\"Sin'X\"\n");

 
    for (i=1;i<=100;i++) {

        if (value>3.1416)value=0;

        sinv=sin(value);

        sindiff=differ();

        printf("\"%f\",\"%f\",\"%f\"", value, sinv, sindiff);

        printf("\n");

        value+=(3.1416/6);

    }

 
    return 0;

 
}


BIT0122-Amit wrote:The codes of chapter 12 by rayhan are available [You must be registered and logged in to see this link.]

BIT0130-Shakkhor wrote:

BIT0122-Amit wrote:The codes of chapter 12 by rayhan are available [You must be registered and logged in to see this link.]

Well, this is interesting Rayhan o taile code korse abar forum eo dise pants o...err...hats off