TheAlgorithms-C/df/d3b/binary__search_8c_ae1a3968e7947464bee7714f6d43b7002_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 3.0.0 (20220226.1711)
 -->
<!-- Title: test Pages: 1 -->
<svg width="154pt" height="84pt"
 viewBox="0.00 0.00 154.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>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 150,-80 150,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Test implementations.">
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 33,-38.5 33,-19.5 0,-19.5"/>
<text text-anchor="middle" x="16.5" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</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#a40855c608ca64048d04cff6526f0a582" target="_top" xlink:title="Recursive implementation.">
<polygon fill="white" stroke="black" points="69,-38.5 69,-57.5 146,-57.5 146,-38.5 69,-38.5"/>
<text text-anchor="middle" x="107.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch1</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="M33,-32.31C40.4,-33.89 49.68,-35.87 59.14,-37.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.47,-41.33 68.98,-39.99 59.93,-34.48 58.47,-41.33"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032" target="_top" xlink:title="Iterative implementation.">
<polygon fill="white" stroke="black" points="69,-0.5 69,-19.5 146,-19.5 146,-0.5 69,-0.5"/>
<text text-anchor="middle" x="107.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M33,-25.69C40.4,-24.11 49.68,-22.13 59.14,-20.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="59.93,-23.52 68.98,-18.01 58.47,-16.67 59.93,-23.52"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M93.63,-57.76C86.88,-66.57 91.5,-76 107.5,-76 117.5,-76 123.05,-72.31 124.17,-67.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="127.52,-66.39 121.37,-57.76 120.79,-68.34 127.52,-66.39"/>
</g>
</g>
</svg>