backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-30 16:51:57 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 20f74d4138

Browse Source
This commit is contained in:
github-actions
2021-08-09 13:06:35 +00:00
parent 0ab8599376
commit 7cbe15159e
246 changed files with 8997 additions and 7723 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d4/d38/power__of__two_8cpp.html
View File

@@ -126,7 +126,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation to check whether a number is a power of 2 or not. </p>
<p>This algorithm uses bit manipulation to check if a number is a power of 2 or not.</p>
<h3><a class="anchor" id="autotoc_md74"></a>
<h3><a class="anchor" id="autotoc_md75"></a>
Algorithm</h3>
<p>Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not</p>
<p>For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2 </p><dl class="section note"><dt>Note</dt><dd>This implementation is better than naive recursive or iterative approach.</dd></dl>