Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43 (00101011).
java bitwise and
4 Articles
4
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43 (00101011).
Rotate bits of a number – Bit Algorithm – A rotation (or circular shift)is an operation similar to shift except that the bits that fall off at one end
Multiply a given Integer with 3.5 – Bit Algorithm – Given a integer x, write a function that multiplies x with 3.5 and returns the integer result.