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 8.0.4 (20230421.1958)
 -->
<!-- Title: main Pages: 1 -->
<svg width="226pt" height="82pt"
 viewBox="0.00 0.00 226.25 82.25" 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 78.25)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" 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="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
<text text-anchor="middle" x="89.25" y="-23.75" 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="#63b8ff" d="M37.2,-27.62C44.67,-27.62 53.52,-27.62 61.73,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.71,-31.13 71.71,-27.62 61.71,-24.13 61.71,-31.13"/>
</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="#666666" points="218.25,-56.25 141.5,-56.25 141.5,-37 218.25,-37 218.25,-56.25"/>
<text text-anchor="middle" x="179.88" y="-42.75" 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="#63b8ff" d="M105.69,-30.93C112.75,-32.45 121.53,-34.33 130.55,-36.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.63,-39.86 140.14,-38.53 131.09,-33.02 129.63,-39.86"/>
</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="#666666" points="218.25,-19.25 141.5,-19.25 141.5,0 218.25,0 218.25,-19.25"/>
<text text-anchor="middle" x="179.88" y="-5.75" 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="#63b8ff" d="M105.69,-24.49C112.75,-23.06 121.53,-21.27 130.55,-19.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.03,-22.71 140.14,-17.29 129.64,-15.85 131.03,-22.71"/>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M165.69,-56.54C159.22,-65.15 163.94,-74.25 179.88,-74.25 188.84,-74.25 194.25,-71.37 196.13,-67.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.38,-66.7 194.06,-57.54 192.5,-68.02 199.38,-66.7"/>
</g>
</g>
</svg>