hey guys:
im having a problem with the bisection method using C++ , the code suppose to find the root of this equation 'X cube minus 3X plus 1' on [0,1] after 5 iterations and after doing it manually the answer should be x=0.009368
it keeps giving me 0.25 and even if i raise iteration number the x raises up which is wrong


thanks in advance ;)
- 2 Contributors
- forum 1 Reply
- 1,547 Views
- 11 Hours Discussion Span
- commentLatest Postby nchy13Latest Post
nchy13
at line 27, u should not write x=(a+b)/2.
it should work fine after this ammendment
Bisection Sort
C Program for Bisection Method to find the roots of an Equation. Do you have the flow chart in detail for bisection and newton’s raphson method?