Documentation for 0fea073413

d3/df9/recursive__bubble__sort_8cpp.html

@@ -142,7 +142,7 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://adityaprakash.tech" target="_blank">Aditya Prakash</a> </dd></dl>
 <p>The working principle of the Bubble sort algorithm.</p>
 <p >Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.</p>
-<h3><a class="anchor" id="autotoc_md109"></a>
+<h3><a class="anchor" id="autotoc_md110"></a>
 Algorithm</h3>
 <p >What is Swap?</p>
 <p >Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:</p>

d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -1,7 +1,7 @@
 <?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.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="288pt" height="242pt"

d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -1,7 +1,7 @@
 <?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.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="362pt" height="242pt"