<div>
You want the code to be in R? You also have included the programming zone, which encompasses a lot of languages.<br />
<br />
Number_of_Ones=bitcount(&quot;A<wbr />BC&quot;,1)<br />
Are you interested in analyzing the binary representation of these 3 chars, and then counting the number of bits that are 1.
</div>


You want the code to be in R? You also have included the programming zone, which encompasses a lot of languages.

Number_of_Ones=bitcount("ABC",1)
Are you interested in analyzing the binary representation of these 3 chars, and then counting the number of bits that are 1.

<div>
@phophric<br />
<br />
nope. Don't care about the individual characters. Just need to know the number of 1s and 0s <br />
<br />
@ Dr Klahn<br />
that looks like it will do the trick. &nbsp;Thanks.
</div>


@phophric

nope. Don't care about the individual characters. Just need to know the number of 1s and 0s

@ Dr Klahn
that looks like it will do the trick.  Thanks.

<div>
my main programming language is VFP but this query is not language specific. I may want to invoke it in Javascript, php, python or whatever. It's actually related to a test for whether or not a given bitstream has been transmitted using the &quot;<a href="https://people.csail.mit.edu/rivest/Chaffing.txt" rel="ugc">Chaffing and Winnowing</a>&quot; protocol described Ron Rivest, with a view to potential improvements to that protocol.
</div>


my main programming language is VFP but this query is not language specific. I may want to invoke it in Javascript, php, python or whatever. It's actually related to a test for whether or not a given bitstream has been transmitted using the "Chaffing and Winnowing [https://people.csail.mit.edu/rivest/Chaffing.txt]" protocol described Ron Rivest, with a view to potential improvements to that protocol.

<div>
haven't yet implemented it but this is clearly a solution to the problem.
</div>


haven't yet implemented it but this is clearly a solution to the problem.

<div>
<div class="content wysiwyg-content">
Anyone know of a relatively straightforward algorithm for computing the numbers of ones and zeroes in an arbitrary string such that, we could address the function thus<br />
<br />
Number_of_Ones=bitcount(ar<wbr />bitrary_st<wbr />ring,1)<br />
Number_of_Zeroes=bitcount(<wbr />arbitrary_<wbr />string,0)
</div>
</div>


Anyone know of a relatively straightforward algorithm for computing the numbers of ones and zeroes in an arbitrary string such that, we could address the function thus

Number_of_Ones=bitcount(arbitrary_string,1)
Number_of_Zeroes=bitcount(arbitrary_string,0)

BITCOUNT ALGORITHM? (to count the ones and zeroes in arbitrary stings)

Programming includes both the specifics of the language you’re using, like Visual Basic, .NET, Java and others, but also the best practices in user experience and interfaces and the management of projects, version control and development. Other programming topics are related to web and cloud development and system and hardware programming.

Programming

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.