Sergio Basurto Juarez wrote:
--- Eric Gaumer <[EMAIL PROTECTED]> wrote:
On Mon, 2004-11-15 at 12:09 -0800, Sergio Basurto
Juarez wrote:
First of all thanks for the note, I think I will
use a
Hashing Table as some one suggest here, becuase in
this case seems to be more suitable f
--- Eric Gaumer <[EMAIL PROTECTED]> wrote:
> On Mon, 2004-11-15 at 12:09 -0800, Sergio Basurto
> Juarez wrote:
> > First of all thanks for the note, I think I will
> use a
> > Hashing Table as some one suggest here, becuase in
> > this case seems to be more suitable for the
> problem,
> > why am
On Mon, 2004-11-15 at 12:09 -0800, Sergio Basurto Juarez wrote:
> First of all thanks for the note, I think I will use a
> Hashing Table as some one suggest here, becuase in
> this case seems to be more suitable for the problem,
> why am so worry about speed, is becuase is a web
> application in ph
On Mon, 15 Nov 2004 10:52:22 -0800 (PST)
Sergio Basurto Juarez <[EMAIL PROTECTED]> wrote:
> To find a key k in an array v with indexes from 0 to
> n-1, begin with x0 = 0, x1 = n-1, and i = 1. Compute
> the next position with
> xi+1 = xi - (v[xi]-k) * (xi - xi-1)/(v[xi] - v[xi-1]).
> If this lies o
--- Ron Johnson <[EMAIL PROTECTED]> wrote:
> On Mon, 2004-11-15 at 10:25 -0800, Sergio Basurto
> Juarez wrote:
> > First of all, I want to leave clear that I know
> that
> > the question that I am asking for, does not have
> to do
> > with this list, but I dare to ask this question
> here
> > bec
On Mon, 2004-11-15 at 10:25 -0800, Sergio Basurto Juarez wrote:
> First of all, I want to leave clear that I know that
> the question that I am asking for, does not have to do
> with this list, but I dare to ask this question here
> because I am sure that here are a lot of good
> programming and sc
--- Bojan Baros <[EMAIL PROTECTED]> wrote:
> Sergio Basurto Juarez said:
> > First of all, I want to leave clear that I know
> that
> > the question that I am asking for, does not have
> to do
> > with this list, but I dare to ask this question
> here
> > because I am sure that here are a lot of
Sergio Basurto Juarez said:
> First of all, I want to leave clear that I know that
> the question that I am asking for, does not have to do
> with this list, but I dare to ask this question here
> because I am sure that here are a lot of good
> programming and scientisitics guys and may be one of
>
8 matches
Mail list logo