// Bisection Method

#include<stdio.h>
#include<curses.h>
#include<math.h>

// Define your function here
float f(float x)
{
    return(pow(x,4) - pow(x,1) - 10);
}

// Main program
main()
{
    float x, x1, a, b, err=0.00005;	// err is the max error allowed
    int i=1, n;

    printf("Enter the values of a, b and maximum iterations \n");
    scanf("%f%f%d",&a, &b, &n);
    x = (a+b)/2;
    printf("Iteration no. %d x = %10.5f\n", i, x);
    i++;

    while(i<n)
    {
	if(f(a)*f(x)<0)			// checking for the signs
	    b = x;			// new interval (a,x)
	else
	    a = x;			// new interval (x,b)
	    x = (a+b)/2;
	    printf("Iteration no. %d x=%10.5f\n", i, x);
	
	if(fabs(x1-x)<err)
	{
	    printf("\nAfter %d iterations, the root is %f\n", i, x);
	    break;
	}

	x1 = x;
	i++;

    }

    if(i>=n)
    {
	printf("\nInsufficient iteration to converge to solution!\n");
    }
    getchar();
}