Xref: utzoo comp.lang.misc:6735 comp.sys.ibm.pc.misc:7033 comp.sources.wanted:15538
Path: utzoo!utgpu!watserv1!watmath!att!linac!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!wuarchive!udel!haven!adm!cmcl2!kramden.acf.nyu.edu!brnstnd
From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.lang.misc,comp.sys.ibm.pc.misc,comp.sources.wanted
Subject: Re: Multiple-Precision Binary to ASCII Decimal Machine Languae Routine
Message-ID: <5519:Mar200:17:1291@kramden.acf.nyu.edu>
Date: 2 Mar 91 00:17:12 GMT
References: <1991Feb18.155207.24378@ux1.cso.uiuc.edu> <7565@uklirb.informatik.uni-kl.de> <25716@neptune.inf.ethz.ch>
Organization: IR
Lines: 10

In article <25716@neptune.inf.ethz.ch> brandis@inf.ethz.ch (Marc Brandis) writes:
> Let us assume we just want to convert a 16-bit value N to its BCD 
> representation. I choose N = 1280.
  [ ... ]
> I do not see how this algorithm can be made work, and I really doubt that it
> can be done without a division at all. Does anybody know for sure?

Why don't you look up the answer in Knuth rather than asking the net?

---Dan