Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #6053
| From | zb <zaeem.burq@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | efficiently testing a list |
| Date | 2011-10-30 09:34 +0000 |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Message-ID | <j8j5o2$fab$1@smc.vnet.net> (permalink) |
Consider the list of pairs:
List = Table[ {a[i],b[i]} , {i,1,N} ].
or
List = { {a[1],b[1]} , {a[2],b[2]} , {a[3],b[3]} , ... ,
{a[N],b[N]} },
and a given function f[a].
What is the quickest way of testing if all elements of List satisfy
f[a[i]] < b[i].
Back to comp.soft-sys.math.mathematica | Previous | Next — Next in thread | Find similar | Unroll thread
efficiently testing a list zb <zaeem.burq@gmail.com> - 2011-10-30 09:34 +0000 Re: efficiently testing a list "Oleksandr Rasputinov" <oleksandr_rasputinov@hmamail.com> - 2011-11-01 05:09 +0000 Re: efficiently testing a list Ray Koopman <koopman@sfu.ca> - 2011-11-02 07:05 +0000
csiph-web