I am wondering how to implement a circular right shift by k of the bitstring represented by the int bits.
public int rtCircShift(int bits, int k)
{
return bits >> k;
}
All this code does is return 0, how can I make it a circular shift?
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.
This should work:
Also see the Wikipedia article on circular shifts.