p may not always be > (n-1) as perceived from the initial question. Like consider copying all the bits of x to y
Anurag Sharma On Tue, Jun 15, 2010 at 7:02 PM, mohit ranjan <[email protected]>wrote: > @Sharad > > assuming p>(n-1) > > o/p= > x & [ ~ { (~((~0)<n)) < (p-n+1) } ] | [ y & [~((~0)<n)]] > > > > Mohit > > > On Tue, Jun 15, 2010 at 2:10 PM, sharad <[email protected]> wrote: > >> CopyBits(x,p,n,y) >> write c code to copy n LSBs from y to x starting LSB at 'p'th >> position using bitwi se..... >> >> -- >> 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]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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.
