TheAlgorithms-C/da/d6c/exponential__search_8c_aae97ef76c065e91c188f1f8c8076869a_cgraph.svg

28 lines
1.2 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 7.0.1 (20221109.1506)
-->
<!-- Title: binary_search Pages: 1 -->
<svg width="85pt" height="45pt"
viewBox="0.00 0.00 85.00 45.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 41)">
<title>binary_search</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="used to perform the binary search over the given array">
<polygon fill="#999999" stroke="#666666" points="77,-19 0,-19 0,0 77,0 77,-19"/>
<text text-anchor="middle" x="38.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="#63b8ff" d="M26.45,-19.37C20.95,-27.94 24.96,-37 38.5,-37 45.69,-37 50.2,-34.44 52.01,-30.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.49,-30.34 50.75,-20.87 48.55,-31.23 55.49,-30.34"/>
</g>
</g>
</svg>