[EMAIL PROTECTED] wrote: > John Machin wrote: > > [EMAIL PROTECTED] wrote: > > > Philippe Martin wrote: > > > > Yes, I came here for the "algorithm" question, not the code result. > > > > > > To turn BCD x to binary integer y, > > > > > > set y to zero > > > for each nibble n of x: > > > y = (((y shifted left 2) + y) shifted left 1) + n > > > > Yeah yeah yeah > > i.e. y = y * 10 + n > > he's been shown that already. > > > > Problem is that the OP needs an 8-decimal-digit (32-bits) answer, but > > steadfastly maintains that he doesn't "have access to" long (32-bit) > > arithmetic in his C compiler!!! > > And he doesn't need one. He might need the algorithms for shift and > add. >
I hate to impose this enormous burden on you but you may wish to read the whole thread. He was given those "algorithms". He then upped the ante to 24 decimal digits and moved the goalposts to some chip running a cut-down version of Java ... TTFN John -- http://mail.python.org/mailman/listinfo/python-list