Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to merge two variables. They both are unsigned ints.
Desired output:
11011111010000
In words: I need to put all the 1 followed by one 0 (in first number) in front of the whole second number. The only think that come to my mind is, to bit shift the first number to the left as many as the length of the second is. And than sum it. But i don’t know the length. Though it probably could be found, isn’t there a better easier way?
Thx
bit shift the first to the right until you have a series of 1’s with no trailing 0.
then bit shift it to the left for the “length” of the second plus 1 (really the amount of bits after and including the first 1)
and then OR them together, don’t sum or else bugs could arise.