Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!wuarchive!gem.mps.ohio-state.edu!apple!usc!bloom-beacon!eru!luth!sunic!mcsun!unido!gmdzi!wittig From: wittig@gmdzi.UUCP (Georg Wittig) Newsgroups: comp.os.cpm Subject: Z80 algorithms Message-ID: <1306@gmdzi.UUCP> Date: 3 Oct 89 13:38:55 GMT Organization: GMD - German National Research Laboratory for Computer Science Lines: 28 The Z80 processor is known to be one of the cheapest processors in the world, but alas it is also known to be NOT one of the fastest. The more I am interested in fast assembler coded algorithms to avoid unnecessary waiting periods. The algorithms I'm interested in are relatively elementary: 16 bit multiplication, 16 bit division, 32 bit arithmetics, filling an arbitraray amount of storage with a given bit pattern, conversion of ascii encoded numbers to binary and vice versa, conversion from binary to hexadecimal notation, etc. Well, I do have such algorithms; but I wonder if they can be made faster. Does there exist a collection of such algorithms I can access? (I don't have access to anonymous ftp.) I'm watching this newsgroup since last winter, and I haven't seen one article on this subject. Or do I watch the wrong newsgroup? :-| If there is someone who wants to send me some of those algorithms, please don't mail them, please post them: I could bet there are some people out there in netland who are interested, too. :-) Waiting patiently ... Thanks in advance, -- Georg Wittig GMD-Z1.BI P.O. Box 1240 D-5205 St. Augustin 1 (West Germany) email: wittig@gmdzi.uucp phone: (+49 2241) 14-2294 ------------------------------------------------------------------------------- "Freedom's just another word for nothing left to lose" (Kris Kristofferson)