bit twiddling hacks, a stanford resource. http://graphics.stanford.edu/~seander/bithacks.html
On Aug 4, 10:55 am, Shashank Jain <shashan...@gmail.com> wrote: > even this is a gud > 1.http://www.cprogramming.com/tutorial/bitwise_operators.html > > Shashank Jain > IIIrd year > Computer Engineering > Delhi College of Engineering > > On Thu, Aug 4, 2011 at 1:35 AM, Samba Ganapavarapu > <sambasiv...@gmail.com>wrote: > > > > > > > > > thanks raj, > > is this the bitwise operator tutorial that you told about ? > > >http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=bitManipulation > > > On Wed, Aug 3, 2011 at 3:48 PM, raj kumar <megamonste...@gmail.com> wrote: > > >> the best way to identify recursion is when finding solution to a > >> problem consist of finding solution to a sub problem > >> ex-5!=5*(4!)=5*4*(3!)..... > >> for bits see topcoder tutorials on bitwise operators > > >> -- > >> 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. > > > -- > > 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. -- 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.
