ph-math/src/main/java/com/helger/numbercruncher/mathutils/BisectionRootFinder.java
@Override
  protected void doIterationProcedure (final int n)
  {
    if (n == 1)
      return; // already initialized

    if (m_fMid < 0)
    {
      m_fXNeg = m_fXMid; // the root is in the xPos half
      m_fNeg = m_fMid;
    }
    else
    {
      m_fXPos = m_fXMid; // the root is in the xNeg half
      m_fPos = m_fMid;
    }
  }
@Override
  protected void doIterationProcedure (final int n)
  {
    if (n == 1)
      return; // already initialized

    if (m_fMid < 0)
    {
      m_fXNeg = m_fXMid; // the root is in the xPos half
      m_fNeg = m_fMid;
    }
    else
    {
      m_fXPos = m_fXMid; // the root is in the xNeg half
      m_fPos = m_fMid;
    }
  }
@ Override protected void doIterationProcedure ( final int n ) { if ( n == 1 ) return ; // already initialized if ( m_fMid < 0 ) { m_fXNeg = m_fXMid ; // the root is in the xPos half m_fNeg = m_fMid ; } else { m_fXPos = m_fXMid ; // the root is in the xNeg half m_fPos = m_fMid ; } }
Do the bisection iteration procedure.

@param n
the iteration count
Do the bisection iteration procedure .