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

Jump to bottom

Lab 04: Change wording on description for recursive function (Binary bit counter) #37

Open

smasher164 opened this issue Sep 20, 2017 · 0 comments

smasher164 commented Sep 20, 2017

if n is even, the number of bits in the representation of n is the same as that in n/2;

This is fine

if n is odd, the number of bits is the same as that in floor(n/2) plus 1.

This sounds like it is saying that if n is odd, the number of bits is numberOfBits(floor(n/2) + 1). This sentence should be reworded to say:

if n is odd, the number of bits is the same as 1 plus that in floor(n/2).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment