On Tue, January 30, 2007 2:30 pm, Ken Dozier wrote:
Thanks to all for your input, guys.
Regarding the construction of the SQL query, I would love to try it
with
SUBSELECTs; but, alas, we are using RHEL 3 which ships with MySQL
3.23. I
don't think RH supports any 4.0 or later versions of
and then come back to it later.
Thanks again for all of your help.
Ken.
-Original Message-
From: Richard Lynch [mailto:[EMAIL PROTECTED]
Sent: Monday, January 29, 2007 6:13 PM
To: Ken Dozier
Cc: php-general@lists.php.net
Subject: Re: [PHP] What search algorithm does in_array() use?
On Mon
: [PHP] What search algorithm does in_array() use?
Thanks to all for your input, guys.
Regarding the construction of the SQL query, I would love to try it with
SUBSELECTs; but, alas, we are using RHEL 3 which ships with MySQL 3.23.
I don't think RH supports any 4.0 or later versions of MySQL
On Mon, January 29, 2007 11:20 am, Ken Dozier wrote:
Does in_array() use a search algorithm (i.e., binary search), or does
it
check sequentially each element in the array?
Since there is no guarantee that the elements are in any particular
order, it almost has to be sequential...
I am using
On Mon, 2007-01-29 at 17:12 -0600, Richard Lynch wrote:
On Mon, January 29, 2007 11:20 am, Ken Dozier wrote:
Does in_array() use a search algorithm (i.e., binary search), or does
it
check sequentially each element in the array?
Since there is no guarantee that the elements are in any
On Mon, January 29, 2007 7:03 pm, Robert Cummings wrote:
On Mon, 2007-01-29 at 17:12 -0600, Richard Lynch wrote:
On Mon, January 29, 2007 11:20 am, Ken Dozier wrote:
Does in_array() use a search algorithm (i.e., binary search), or
does
it
check sequentially each element in the array?
On Mon, 2007-01-29 at 19:14 -0600, Richard Lynch wrote:
On Mon, January 29, 2007 7:03 pm, Robert Cummings wrote:
Only perfect hashes have O(1) lookup, and in practice there are very
few
perfect hashes set up in reality since the cost to produce a perfect
hash outweighs the time
7 matches
Mail list logo
