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.

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
Changes from 1 commit
Commits
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
indentation improved
  • Loading branch information
NISHITA97 authored Dec 29, 2017
commit 8db4ef901c8fef6bc90d59773256c5c912f4dff9
10 changes: 5 additions & 5 deletions Others/BrianKernighanAlgorithm.java
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@
*
* @author Nishita Aggarwal
*
* Brian Kernighans Algorithm
* Brian Kernighans 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
Expand All @@ -24,10 +24,10 @@
public class BrianKernighanAlgorithm {

/**
* @param num: number in which we count the set bits
*
* @return int: Number of set bits
* */
* @param num: number in which we count the set bits
*
* @return int: Number of set bits
* */
static int countSetBits(int num)
{
int cnt = 0;
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