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 7.0.6 (20230106.0513)
 -->
<!-- Title: main Pages: 1 -->
<svg width="228pt" height="82pt"
 viewBox="0.00 0.00 228.00 82.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 78)">
<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="38,-37 0,-37 0,-18 38,-18 38,-37"/>
<text text-anchor="middle" x="19" y="-25" 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="107,-37 74,-37 74,-18 107,-18 107,-37"/>
<text text-anchor="middle" x="90.5" y="-25" 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="M38.26,-27.5C45.72,-27.5 54.5,-27.5 62.66,-27.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.44,-31 72.44,-27.5 62.44,-24 62.44,-31"/>
</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="220,-56 143,-56 143,-37 220,-37 220,-56"/>
<text text-anchor="middle" x="181.5" y="-44" 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="M107.41,-30.9C114.3,-32.37 122.78,-34.18 131.49,-36.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.55,-39.42 141.06,-38.08 132.01,-32.57 130.55,-39.42"/>
</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="220,-19 143,-19 143,0 220,0 220,-19"/>
<text text-anchor="middle" x="181.5" y="-7" 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="M107.41,-24.28C114.3,-22.89 122.78,-21.17 131.49,-19.41"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.95,-22.89 141.06,-17.48 130.56,-16.03 131.95,-22.89"/>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M167.25,-56.37C160.76,-64.94 165.5,-74 181.5,-74 190.25,-74 195.63,-71.29 197.65,-67.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.15,-67.12 196,-57.86 194.25,-68.31 201.15,-67.12"/>
</g>
</g>
</svg>