backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-01 22:13:03 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 06b6714b0e

Browse Source
This commit is contained in:
github-actions
2020-10-16 12:47:23 +00:00
parent 017448e6ad
commit 5b6c358009
357 changed files with 9994 additions and 5682 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -192,6 +192,7 @@ Graph</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/depth_first_search_with_stack.cpp">Depth First Search With Stack</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/dijkstra.cpp">Dijkstra</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/hamiltons_cycle.cpp">Hamiltons Cycle</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/hopcroft_karp.cpp">Hopcroft Karp</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/is_graph_bipartite.cpp">Is Graph Bipartite</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/kosaraju.cpp">Kosaraju</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/kruskal.cpp">Kruskal</a></li>

2
d5/ddb/bogo__sort_8cpp.html
View File

@@ -136,7 +136,7 @@ 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>
<h3><a class="anchor" id="autotoc_md57"></a>
<h3><a class="anchor" id="autotoc_md63"></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>