Re: which one is faster/better > or >=
- From: "Ian Semmel" <anyone@xxxxxxxxxxxxxxxxx>
- Date: Fri, 25 Jan 2008 04:29:15 +0000
"Michael C" <mike@xxxxxxxxxx> wrote in message news:OV$jKotXIHA.5348@xxxxxxxxxxxxxxxxxxxx:
"Larry Smith" <no_spam@xxxxxxxxxxx> wrote in message
news:Ok11I7OXIHA.3556@xxxxxxxxxxxxxxxxxxxxxxx
> This type of hairsplitting won't benefit you in any way you'll ever
> notice. From a performance perspective, it's a complete waste of time
even
> thinking about it.
One thing I wanted to add was that if creating a fast algorithm then
something like this would just be one tool in the toolchest. It might
gain a
1% advantage but in combination with other optimisations it could give
real
benefits.
Michael
1% ??? It must be the most trivial algorithm of all time.
or
You meant .00001%
.
- Follow-Ups:
- Re: which one is faster/better > or >=
- From: Michael C
- Re: which one is faster/better > or >=
- References:
- Re: which one is faster/better > or >=
- From: Michael C
- Re: which one is faster/better > or >=
- Prev by Date: Move treenodes up and down the tree
- Next by Date: Re: which one is faster/better > or >=
- Previous by thread: Re: which one is faster/better > or >=
- Next by thread: Re: which one is faster/better > or >=
- Index(es):
Relevant Pages
|