Please help. I am quite new to java, and am currently working on a Radix Sorter using Queues. At the moment my Radix Sorter uses a radix of 10. To extract the first digit, it divides the integer by 10, and takes the remainder. To extract the second digit it divides the integer by 100, takes the remainder and then divides that by 10, and so on... But I now have to modify the Radix Sorter to use a radix of 2, which means that division will be done by a power of 2. This apparently can be done using bit shift operators. I am not sure how i can extract the necesarry digits using a radix of 2.
Previous Topic
