From: Steve Quinlan <steven.quinlan@nospam.lmco.com>
Subject: Re: Large Look-up Table question ?
Date: 1999/06/01
Date: 1999-06-01T16:59:03+00:00 [thread overview]
Message-ID: <37541246.C2CA535A@nospam.lmco.com> (raw)
In-Reply-To: 375299F4.CDEA8A81@hotmail.com
If the matrix is sparse, arrays may be "clunky", but are also the simplest
implementation. If the matrix is not too big to be practically implemented
by an array, and if you can live with wasted storage (and possibly poor
performance) go with it. At least evaluate the tradeoffs.
If the matrix is not sparse, then an array is just as space efficient and
probably more time efficient than any of the normal ways of dealing with
sparse matrices.
next prev parent reply other threads:[~1999-06-01 0:00 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-05-31 0:00 Large Look-up Table question ? Nick Wilson
1999-06-01 0:00 ` czgrr
1999-06-01 0:00 ` Steve Quinlan [this message]
1999-06-02 0:00 ` Nick Roberts
1999-06-03 0:00 ` Ehud Lamm
1999-06-03 0:00 ` dennison
1999-06-07 0:00 ` Nick Wilson
1999-06-07 0:00 ` dennison
1999-06-09 0:00 ` Mike Brenner
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox