__bitcount(a ^ b), or use bitset<32> or int x=0; int y=a^b; while(y) {x++;y&=y-1;} return x;
2009/8/17 Pramod Negi <negi.1...@gmail.com> > i guess XORing A and B and count the no of set bits will do. > > > On Sun, Aug 16, 2009 at 11:09 PM, richa gupta <richa.cs...@gmail.com>wrote: > >> >> Given two integers A & B. Determine how many bits required to convert >> A to B.how to write a function int BitSwapReqd(int A, int B); >> >> -- >> Richa Gupta >> (IT-BHU,India) >> >> >> > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---