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 6.0.2 (20221011.1828)
 -->
<!-- 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.5C46.07,-27.5 55.31,-27.5 63.79,-27.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="63.95,-31 73.95,-27.5 63.95,-24 63.95,-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,-30.81C114.4,-32.39 123.68,-34.37 133.14,-36.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="132.47,-39.83 142.98,-38.49 133.93,-32.98 132.47,-39.83"/>
</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,-24.36C114.4,-22.87 123.68,-20.99 133.14,-19.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.87,-22.5 142.98,-17.09 132.49,-15.64 133.87,-22.5"/>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M167.47,-56.08C160.65,-64.73 165.33,-74 181.5,-74 191.36,-74 196.94,-70.56 198.26,-65.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.58,-64.78 195.53,-56.08 194.83,-66.65 201.58,-64.78"/>
</g>
</g>
</svg>