TheAlgorithms-C/df/d3b/binary__search_8c_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
 -->
<!-- Title: main Pages: 1 -->
<svg width="228pt" height="84pt"
 viewBox="0.00 0.00 228.00 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 224,-80 224,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 38,-38.5 38,-19.5 0,-19.5"/>
<text text-anchor="middle" x="19" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title="Test implementations.">
<polygon fill="white" stroke="black" points="74,-19.5 74,-38.5 107,-38.5 107,-19.5 74,-19.5"/>
<text text-anchor="middle" x="90.5" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.26,-29C46.07,-29 55.31,-29 63.79,-29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-32.5 73.95,-29 63.95,-25.5 63.95,-32.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582" target="_top" xlink:title="Recursive implementation.">
<polygon fill="white" stroke="black" points="143,-38.5 143,-57.5 220,-57.5 220,-38.5 143,-38.5"/>
<text text-anchor="middle" x="181.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch1</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M107,-32.31C114.4,-33.89 123.68,-35.87 133.14,-37.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.47,-41.33 142.98,-39.99 133.93,-34.48 132.47,-41.33"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032" target="_top" xlink:title="Iterative implementation.">
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 220,-19.5 220,-0.5 143,-0.5"/>
<text text-anchor="middle" x="181.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch2</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M107,-25.69C114.4,-24.11 123.68,-22.13 133.14,-20.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="133.93,-23.52 142.98,-18.01 132.47,-16.67 133.93,-23.52"/>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M167.63,-57.76C160.88,-66.57 165.5,-76 181.5,-76 191.5,-76 197.05,-72.31 198.17,-67.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="201.52,-66.39 195.37,-57.76 194.79,-68.34 201.52,-66.39"/>
</g>
</g>
</svg>