I've been playing around with it Magnus. It will be more difficult as it would have to take into account the possibility of generating negative output. The ascii adder was only designed to work with positive numbers specifically. In my initial experiments I did not consider subtracting a large value from a smaller one, was always a smaller value from large. But with a bit of extra code, I suppose it could be done. But remember, the adder worked bytewise. A subtractor would have some unruly code plus keeping track of sign. I don't know if I could muster up the skills for all of that.
Thinking about this again, I have reconsidered making the subtractor and divider. Too much effort with too little gain, imo. A multiplier would be as easy as recursive calls to the adder.
And a LOT of allocated memory.
So, on second thought I probably won't be finishing any ascii math library soon. If I have at least a full week to devote to experimenting with a subtractor that can flawlessly work with negative numbers, then I could *possibly* investigate it further. Until then, this will be on the back burner.
When I do decide to make a subtractor, it won't be ascii at first. This will eliminate the extra fiddling with the ascii conversion, and more time for dealing with the data. Big data that is.
Since I'll be dealing with byte data, I probably would work with hex values instead of decimal. I think anyway. We'll see...
