Login | Register   
RSS Feed
Download our iPhone app
Browse DevX
Sign up for e-mail newsletters from DevX

By submitting your information, you agree that devx.com may send you DevX offers via email, phone and text message, as well as email offers about other products and services that DevX believes may be of interest to you. DevX will process your information in accordance with the Quinstreet Privacy Policy.

Tip of the Day
Language: VB4,VB5,VB6
Expertise: Intermediate
Jun 5, 1999



Building the Right Environment to Support AI, Machine Learning and Deep Learning

Counting Bits

It seems that the only way to count the number of 1's or 0's in a binary value is creating a loop that iterates on all the 16 or 32 bits of the number. There is, however, a faster algorithm:

Function BitCount (ByVal number As Long) As Integer
  Dim bits As Integer, temp As Long
  temp = number
  Do While temp
    temp = temp And (temp - 1)
    bits = bits + 1
  BitCount = bits
End Function

While this code apparently makes little sense, it can be explained knowing that the expression n And (n - 1) actually drops the least significant (i.e. the rightmost) bit that is set in n. If you repeat this operation until the number becomes zero, you can indirectly evaluate how many 1's were in the number. On the average this requires half of the iterations needed by the standard method.

Francesco Balena
Comment and Contribute






(Maximum characters: 1200). You have 1200 characters left.



Thanks for your registration, follow us on our social networks to keep up-to-date