Skip to content

Brian Kernighan’s Algorithm added #367

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Dec 31, 2017
Merged

Brian Kernighan’s Algorithm added #367

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
55b9080
Brian Kernighan’s Algorithm added
NISHITA97 Dec 29, 2017
8db4ef9
indentation improved
NISHITA97 Dec 29, 2017
5cf2203
spacing improved
NISHITA97 Dec 31, 2017
1567b58
Update BrianKernighanAlgorithm.java
varunu28 Dec 31, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
spacing improved
  • Loading branch information
@NISHITA97
NISHITA97 authored Dec 31, 2017
commit 5cf220362a37c982a26dc81f2e87159fe99b2495
8 changes: 5 additions & 3 deletions Others/BrianKernighanAlgorithm.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,16 +5,18 @@
* @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)
*
Expand Down
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy