The very obvious sudo code would be: count=0 while n is not 0 do right shift bits of n count=count+1 done return count
Though i still get a feel a better logic must be there,....... On Mon, Nov 14, 2011 at 4:26 PM, Gene <gene.ress...@gmail.com> wrote: > Actually aren't you off by 1 in each case? 1 = 2^0, not 2^1. > > On Nov 14, 7:06 am, Ankur Goel <goel.anku...@gmail.com> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
