From 7c643cb5c0329dbc84a1db214a02641785c173ba Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sun, 19 Jul 2020 18:44:25 +0000
Subject: [PATCH] Documentation for ef1bf8849e01cf7f9c24315752e8c9b128615952

---
 d5/ddb/bogo__sort_8cpp.html | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 554bcb783..14c7e0c13 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,9 +136,11 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
 <p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
-<p>Algorithm - <br  />
- </p><pre class="fragment"> Shuffle the array untill array is sorted.
-</pre> </div><h2 class="groupheader">Function Documentation</h2>
+<h3><a class="anchor" id="autotoc_md40"></a>
+Algorithm</h3>
+<p>Shuffle the array untill array is sorted.</p>
+<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>
+</div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>