There appears to be a typo in problem 6 that might throw people off. In the code example, it shows examples of the left bit shift and then the right bit shift in that order. However, in the text below it says: "This operation is mathematically equivalent to floor dividing and multiplying by 2 (respectively)". This is backwards. The left shift multiplies by 2^x and the right shift divides by 2^x, not the other way around. I hope someone can fix this.
This topic was automatically closed 7 days after the last reply. New replies are no longer allowed.