Re: count2.asm
- From: "¬a\\/b" <al@xxx>
- Date: Wed, 27 Jul 2005 16:12:05 GMT
On Tue, 26 Jul 2005 11:44:12 -0400, Frank Kotler
<fbkotler@xxxxxxxxxxx> wrote:
>a\/b wrote:
>> On Mon, 25 Jul 2005 13:58:46 -0400, Frank Kotler
>>
>> this is my not tested one in C
>>
>> #include <stdio.h>
[etc]
[...]
>[The compiler can never win. If the compiler produces faster code, we
>use that. If the human produces faster code, we use that. The best the
>compiler can do is break even.]
Is it possible that one can do some C code that assembly people can
not do faster? (>0.1%) (i think yes, because i have seen that code)
>One minor nit to pick... You seem to have solved the "Y question" by not
>counting 'y's as either vowels or consonants - you've removed it from
>the "vowel strings" (upper and lower), but didn't add it to the
>"consonant strings". Easy to fix. I should fix that in my own code!
ok, ok here the vowels are "aeiou"
>Another thing I should probably fix... I don't have LF's CR's and tabs
>in my "punctuation string" - I *did* count them as punctuation in the
>first version. I don't really know which is "right" here...
lf cr are 10 13?
If the file is read in "text form" seems to me "\n"==10, 13 or 13,10 i
don't remember; in the "binary form" "\n"==10
>Nice job! Thanks!
it is buggy, i had no time for it because i had to go in my city for
doing many things. You have not "thanks" to me because
1) it is C not assembly
2) because if 'o' is signed char (if char==signed char) then "list[o]"
(seems to me) can read memory out of "list" (if o<0)
but i have an hart of troll!!!! :-)
.
- Follow-Ups:
- Re: count2.asm
- From: randyhyde
- Re: count2.asm
- From: wolfgang kern
- Re: count2.asm
- References:
- count2.asm
- From: Frank Kotler
- Re: count2.asm
- From: ¬a\\/b
- Re: count2.asm
- From: Frank Kotler
- count2.asm
- Prev by Date: Re: HAY Betov, still no support for GPL or LINUX, WHY ????
- Next by Date: Re: count2.asm
- Previous by thread: Re: count2.asm
- Next by thread: Re: count2.asm
- Index(es):
Relevant Pages
|