Can you define the question more precisely? Do you want the largest power of 2 <= n, or the largest power of two which divides into n? In the first case, it is the number of digits after the leftmost 1 in the binary representation. In the latter case, it is the number of trailing zeros in the binary representation. Don
On Nov 14, 12:06 am, Ankur Goel <[email protected]> wrote: > How to find highest power of 2 in an integer > > Suppose number is > 00001 - Highest power of 2 is 1 > 00011 - Highest power of 2 is 2 > 11000 - Highest power of 2 is 5 > > No loops -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
