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

Documentation for dc8ecfbf50

Browse Source
This commit is contained in:
github-actions
2023-02-03 21:18:47 +00:00
parent a87e2fa7cb
commit fca5b514ec
1745 changed files with 2847 additions and 2348 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
files.html
View File

@@ -121,8 +121,9 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html" target="_self">count_of_trailing_ciphers_in_factorial_n.cpp</a></td><td class="desc"><a href="https://www.tutorialspoint.com/count-trailing-zeros-in-factorial-of-a-number-in-cplusplus" target="_blank">Count the number of ciphers</a> in <code>n!</code> implementation </td></tr>
<tr id="row_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d38/find__non__repeating__number_8cpp.html" target="_self">find_non_repeating_number.cpp</a></td><td class="desc">Implementation to find the non repeating integer in an array of repeating integers. <a href="https://leetcode.com/problems/single-number/" target="_blank">Single Number</a> </td></tr>
<tr id="row_1_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d48/hamming__distance_8cpp.html" target="_self">hamming_distance.cpp</a></td><td class="desc">Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers </td></tr>
<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db5/set__kth__bit_8cpp.html" target="_self">set_kth_bit.cpp</a></td><td class="desc">Implementation to [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) in an integer </td></tr>
<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html" target="_self">travelling_salesman_using_bit_manipulation.cpp</a></td><td class="desc">Implementation to [Travelling Salesman problem using bit-masking] (<a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/">https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/</a>) </td></tr>
<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d6d/power__of__2_8cpp.html" target="_self">power_of_2.cpp</a></td><td class="desc">[Find whether a given number is power of 2] (<a href="https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/">https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/</a>) implementation </td></tr>
<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db5/set__kth__bit_8cpp.html" target="_self">set_kth_bit.cpp</a></td><td class="desc">Implementation to [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) in an integer </td></tr>
<tr id="row_1_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html" target="_self">travelling_salesman_using_bit_manipulation.cpp</a></td><td class="desc">Implementation to [Travelling Salesman problem using bit-masking] (<a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/">https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/</a>) </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9658;</span><span id="img_2_" class="iconfclosed" onclick="toggleFolder('2_')">&#160;</span><a class="el" href="dir_4d6e05837bf820fb089a8a8cdf2f42b7.html" target="_self">ciphers</a></td><td class="desc"></td></tr>
<tr id="row_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/db6/a1z26__cipher_8cpp.html" target="_self">a1z26_cipher.cpp</a></td><td class="desc">Implementation of the <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26 cipher</a> </td></tr>
<tr id="row_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dfb/atbash__cipher_8cpp.html" target="_self">atbash_cipher.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation </td></tr>