TheAlgorithms-C/da/d6c/exponential__search_8c_aae97ef76c065e91c188f1f8c8076869a_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.49.3 (20211023.0002)
-->
<!-- Title: binary_search Pages: 1 -->
<svg width="87pt" height="46pt"
viewBox="0.00 0.00 87.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>binary_search</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 83,-42 83,4 -4,4"/>
<!-- 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="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 79,-19.5 79,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39.5" y="-7.5" 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="midnightblue" d="M27.48,-19.76C21.63,-28.57 25.64,-38 39.5,-38 47.95,-38 52.74,-34.5 53.86,-29.77"/>
<polygon fill="midnightblue" stroke="midnightblue" points="57.21,-28.7 51.52,-19.76 50.39,-30.29 57.21,-28.7"/>
</g>
</g>
</svg>