Algorithm question: How do you rank each bit in reverse order (bit) in an n-byte number? For example 1-byte number 0010 0011 = 1100 0100

A simple question, if the java,c++,c estimate is quite troublesome, the general idea is to open up an n-byte space, using the shift mask method to each bit to assign a value, here because n may be larger, but also to record some additional boundary information.

Using Erlang is a lot easier:

-Module(bitoperator). -Export([bit_reverse/1            -Bin],            = lists:reverse (L),             = List_to_binary (Lr),            << <<X:1>> | | <<X:8>> <= Br >>.

The idea is to turn the bit into a 0,1 size of 1 bytes (like a byte variable in Java), then order in reverse, and then sequentially take the lowest bit to re-compose the result.

Algorithm question: How do you rank each bit in reverse order (bit) in an n-byte number? For example 1-byte number 0010 0011 = 1100 0100