Path: news.mathworks.com!not-for-mail
From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Search matrix for the first closest match
Date: Mon, 22 Dec 2008 00:21:02 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 9
Message-ID: <gimmhe$9v$1@fred.mathworks.com>
References: <gimkuq$l7u$1@fred.mathworks.com>
Reply-To: <HIDDEN>
NNTP-Posting-Host: webapp-02-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1229905262 319 172.30.248.37 (22 Dec 2008 00:21:02 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Mon, 22 Dec 2008 00:21:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1187260
Xref: news.mathworks.com comp.soft-sys.matlab:508259


"Conrad Andrew" <conrad7@gmx.net> wrote in message <gimkuq$l7u$1@fred.mathworks.com>...
> .......
> I want to be able to find the index of the first closest match to 6 within the matrix given a specific index to start the search from.
> ......

  When I see two superlatives specified for a single entity, it always raises a warning flag.  In your particular case the obvious question is, "what makes you think the 'the closest' will be 'the soonest'?"  How do you balance between how close a match the two sets of six have as compared with how far apart in the list they occur?

Roger Stafford