I found a good question to try for bit manipulation.....Try it... :) Given an integer x, find out the smallest integer which has same number of set bits as x and is greater than x.
For example if the input integer is 12 (1100) then your function should return 17(10001). If the input integer is 3(11) then your function should return 5(101) -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=100000655377926 * -- 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.
