ftp.delorie.com/archives/browse.cgi | search |
From: | aho450s AT nic DOT smsu DOT edu (Tony O'Bryan) |
Newsgroups: | comp.os.msdos.djgpp |
Subject: | Re: floating point is... fast??? |
Date: | Mon, 20 Jan 1997 02:36:34 GMT |
Organization: | Southwest Missouri State University |
Lines: | 8 |
Message-ID: | <32e2d9f1.302028@ursa.smsu.edu> |
References: | <5brd2e$dap AT lyra DOT csx DOT cam DOT ac DOT uk> <32E2D80E DOT 7760 AT gbrmpa DOT gov DOT au> |
NNTP-Posting-Host: | forseti.i53.smsu.edu |
To: | djgpp AT delorie DOT com |
DJ-Gateway: | from newsgroup comp.os.msdos.djgpp |
On Mon, 20 Jan 1997 02:27:26 GMT, Leath Muller <leathm AT gbrmpa DOT gov DOT au> wrote: >point unit to do the operations - thus an integer mul/divide has the >overhead of converting the int -> float, div/mul, then float -> int. >Whereas the floating point calculations just do the div/mul... This doesn't make sense to me, especially for processors that don't even have floating point units ( <= 486sx).
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |