Skip to content

Instantly share code, notes, and snippets.

@sreeprasad

sreeprasad/count number of bits set fast approach

Created June 28, 2018 14:12
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save sreeprasad/9f14790b9f68495af1d46b29c97c0bcd to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save sreeprasad/9f14790b9f68495af1d46b29c97c0bcd to your computer and use it in GitHub Desktop.
Download ZIP
Find the number of bits set in O(K) where K is the number of bits set
Raw
count number of bits set fast approach
int findCount(int N) {
while(N>0){
count++;
N= N&(N-1);
}
return count;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment