View Single Post
Old 6th July 2004, 16:41   #4
Junior Member
Join Date: Jan 2004
Location: berlin, germany
Posts: 44
Is there no case differentiation in the multiplication algo, that makes multiplication with whole numbers faster?
I prefer the bnot() method, because it's easier to read the source.
Having tons of if(b,if(1-c,if(a,0,d),1),5); things sux.
I gave up using division too.
Though /3 is shorter than *.333.
your-dentist is offline   Reply With Quote