<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
    <title>invariant - bisection</title>
    <subtitle>Essays on algorithms and data structures by Ali Khalilli. Binary search, numerical methods, dynamic programming, graphs, strings.</subtitle>
    <link rel="self" type="application/atom+xml" href="https://invariant.khalilli.ai/tags/bisection/atom.xml"/>
    <link rel="alternate" type="text/html" href="https://invariant.khalilli.ai"/>
    <generator uri="https://www.getzola.org/">Zola</generator>
    <updated>2021-12-08T00:00:00+00:00</updated>
    <id>https://invariant.khalilli.ai/tags/bisection/atom.xml</id>
    <entry xml:lang="en">
        <title>The Bisection Method</title>
        <published>2021-12-08T00:00:00+00:00</published>
        <updated>2021-12-08T00:00:00+00:00</updated>
        
        <author>
          <name>
            
              alikhalilli
            
          </name>
        </author>
        
        <link rel="alternate" type="text/html" href="https://invariant.khalilli.ai/blog/bisection-method/"/>
        <id>https://invariant.khalilli.ai/blog/bisection-method/</id>
        
        <summary type="html">&lt;p&gt;Consider the following scenario: we have a nonlinear equation and are attempting to solve it using a computer program. For the nonlinear equation, what strategy can the CPU employ in order to compute a solution? Alternatively, from what point of view would we address that challenge in terms of efficacy?&lt;&#x2F;p&gt;</summary>
        
    </entry>
</feed>
