TheAlgorithms-C/df/d3b/binary__search_8c_a40855c608ca64048d04cff6526f0a582_cgraph.svg

29 lines
1.3 KiB
XML
Raw Normal View History

<?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: binarysearch1 Pages: 1 -->
<svg width="85pt" height="46pt"
viewBox="0.00 0.00 85.00 46.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 42)">
<title>binarysearch1</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 81,-42 81,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive implementation.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 77,-19.5 77,-0.5 0,-0.5"/>
<text text-anchor="middle" x="38.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">binarysearch1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M26.79,-19.76C21.09,-28.57 24.99,-38 38.5,-38 46.73,-38 51.4,-34.5 52.5,-29.77"/>
<polygon fill="midnightblue" stroke="midnightblue" points="55.85,-28.73 50.21,-19.76 49.02,-30.28 55.85,-28.73"/>
</g>
</g>
</svg>