I am trying to create a "fast find first of" algorithm in assembler. The problem is that the two string instructions that look promising, CMPSB and SCASB, have large overheads, but low per character checks. I could possibly use simplier instructions to maybe make use of the pipelining features of the Pentium but I really do not know if that will create a faster algorithm.
What's your ideas on this subject?
