From 5cf220362a37c982a26dc81f2e87159fe99b2495 Mon Sep 17 00:00:00 2001 From: Nishita Aggarwal Date: Sun, 31 Dec 2017 15:02:56 +0530 Subject: [PATCH] spacing improved --- Others/BrianKernighanAlgorithm.java | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/Others/BrianKernighanAlgorithm.java b/Others/BrianKernighanAlgorithm.java index a4ea69ce..eaf43093 100644 --- a/Others/BrianKernighanAlgorithm.java +++ b/Others/BrianKernighanAlgorithm.java @@ -5,16 +5,18 @@ import java.util.Scanner; * @author Nishita Aggarwal * * Brian Kernighan’s Algorithm + * * algorithm to count the number of set bits in a given number + * * Subtraction of 1 from a number toggles all the bits (from * right to left) till the rightmost set bit(including the * rightmost set bit). * 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 * 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) *