On 2004.03.01 12:46, Chris Green wrote:
The advantage of a binary chop is that it is quite possible to generate the table in assembler, it's just a matter of finding some way to sort it, preferably pre-assembler.
If you are concerned about a long debug loop perfecting an algorithm implemented in assembler, why not first implement it in C so you know you've got it right and then translate it?
You could compile and debug in on any platform with a decent C compiler and then, when you're ready to go to assembler you could even use a C cross compiler to generate and initial implementation in assembler. GCC can compile for 68000 and has a -S option to generate an assembler file rather than an object file. After that you could go over the assembler my hand to check it is well optimised and remove any dependencies on compiler supplied libraries and you're there.
Steve.