Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

spacing improved

Browse Source
This commit is contained in:
Nishita Aggarwal 2017-12-31 15:02:56 +05:30 committed by GitHub
parent 8db4ef901c
commit 5cf220362a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Others/BrianKernighanAlgorithm.java
View File

@ -5,16 +5,18 @@ import java.util.Scanner;
* @author Nishita Aggarwal * @author Nishita Aggarwal
* *
* Brian Kernighan’s Algorithm * Brian Kernighan’s Algorithm
*
* algorithm to count the number of set bits in a given number * algorithm to count the number of set bits in a given number
*
* Subtraction of 1 from a number toggles all the bits (from * Subtraction of 1 from a number toggles all the bits (from
* right to left) till the rightmost set bit(including the * right to left) till the rightmost set bit(including the
* rightmost set bit). * rightmost set bit).
* So if we subtract a number by 1 and do bitwise & with * So if we subtract a number by 1 and do bitwise & with
* itself (n & (n-1)), we unset the rightmost set bit. * itself i.e. (n & (n-1)), we unset the rightmost set bit.
*
* If we do n & (n-1) in a loop and count the no of times loop * If we do n & (n-1) in a loop and count the no of times loop
* executes we get the set bit count. * executes we get the set bit count.
* Number of iterations of the loop is equal to the number of *
* set bits in a given integer.
* *
* Time Complexity: O(logn) * Time Complexity: O(logn)
* *