Re: Efficient Vector Comparison
- From: Ben Pfaff <blp@xxxxxxxxxxxxxxx>
- Date: Thu, 28 Jun 2007 15:51:19 -0700
Pascal Bourguignon <pjb@xxxxxxxxxxxxxxxxx> writes:
Yao Qi <qiyaoltc@xxxxxxxxx> writes:
"Jim Langston" <tazmaster@xxxxxxxxxxxxxx> writes:
"Yao Qi" <qiyaoltc@xxxxxxxxx> wrote in message
news:m34pks4g7i.fsf@xxxxxxxxxxxx
the
In our program, we will compare every two vectors. In current
implementation, we compare every element of that vector until we get
comparison result. It is not any more efficient way to do this?
b.t.w the length of vector is variable.
Comparing two vectors for what, equality?
Yes, but more than this. We have to compare two vectors to see if they
are equal or one is bigger or smaller than the other one.
What does it mean for a vector to be bigger or smaller than another one?
One possibility is lexicographical ordering. The OP's statement
"...we compare every element of that vector until we get the
comparison result" suggests this ordering is the one desired.
--
"Sanity is not statistical."
--George Orwell
.
- References:
- Efficient Vector Comparison
- From: Yao Qi
- Re: Efficient Vector Comparison
- From: Jim Langston
- Re: Efficient Vector Comparison
- From: Yao Qi
- Re: Efficient Vector Comparison
- From: Pascal Bourguignon
- Efficient Vector Comparison
- Prev by Date: Re: Efficient Vector Comparison
- Next by Date: Re: The software I wish I had
- Previous by thread: Re: Efficient Vector Comparison
- Next by thread: Re: Efficient Vector Comparison
- Index(es):
Relevant Pages
|