Program Of bisection Method

# include <stdio.h>

# include <conio.h>

#include  < math.h>

# include <process.h>

#include <string.h>

# define EPS  0.00000005

# define  f(x)     x³ – x – 1

   void  Bisect ()

   int count  = 1 , n

   float root = 1;

  void main ()

  {

     clrscr (),

   priftf(“\n solution by Bisection method\n”);

    printf(“Equation”);

    printf(“\n\t\t\t x³ –x – 1 =0 \n\n”)

    printf(“Enter the no. of iteration:”);

    scanf(“%d”,&n);

    Bisect ();

    getch ();

 }

     void Bisect ()

 {

      float x₀, x₁, x₂ ;

      float f₀, f₁, f₂ ;

      int I =0 ;

     for (x₂ = 1; x₂++)

{

     f₂  =  f(x₂);

     if (f₂ < 0);

     {

         Break ;

      }

}

     printf(“\n\t\t_ _ _ _ _ _ _ _ _ _ _ _ _”);

     printf(“\n\t\t   Root  = %  f ”,x₀);

     printf(“\n\t\t  ITERATION = %d\n”, count -1 );

      printf(“\t\t_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ ”);

      getch();

}

         Algorithm of Bisection Method

Step1:- Start of the program.

Step2:- I/P the various x₁, x₂, for the task.

Step3:- Check f(x₁) * f(x2) < 0

Step4:- If yes proceed.

Step5:- If no exit & print error message.

Step6:- Repeat 7 – 11 if condition not satisfied.

Step7:-  x₀= (x₁ + x₂)/2

Step8:- if f(x₀) * f(x₁) < 0

Step9:- x₂ = x₀

Step10:- ELSE

Step11:-   x₁ = x₀

Step12:-   Condition

Step13:- |(x₁ – x₂ ) /x₁ | < max. possible error or f(x₀) = 0.

Step14:-    printf o/p

Step15 :-   End of program.