From 1567b58a46c2a7f7d92af4e8cb0c712d78569a08 Mon Sep 17 00:00:00 2001 From: Varun Upadhyay Date: Sun, 31 Dec 2017 06:47:51 -0800 Subject: [PATCH] Update BrianKernighanAlgorithm.java --- Others/BrianKernighanAlgorithm.java | 9 +++------ 1 file changed, 3 insertions(+), 6 deletions(-) diff --git a/Others/BrianKernighanAlgorithm.java b/Others/BrianKernighanAlgorithm.java index eaf43093f..cb27eec15 100644 --- a/Others/BrianKernighanAlgorithm.java +++ b/Others/BrianKernighanAlgorithm.java @@ -8,14 +8,11 @@ import java.util.Scanner; * * 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 + * 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 i.e. (n & (n-1)), we unset the rightmost set bit. + * So if we subtract a number by 1 and do bitwise & with 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. + * If we do n & (n-1) in a loop and count the no of times loop executes we get the set bit count. * * * Time Complexity: O(logn)