Newsgroups: php.internals
Path: news.php.net
Xref: news.php.net php.internals:85628
Mailing-List: contact internals-help@lists.php.net; run by ezmlm
Received-SPF: pass (pb1.pair.com: domain gmail.com designates 209.85.192.170 as permitted sender)
Message-ID: <551BA415.7050809@gmail.com>
Date: Wed, 01 Apr 2015 00:53:57 -0700
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.9; rv:31.0) Gecko/20100101 Thunderbird/31.5.0
MIME-Version: 1.0
To: Danylo Medinsky <medinsky94@gmail.com>, internals@lists.php.net
References: <CAJCMAP7kZqNcrN-KdRPk=bUQqM4_jNpbd=D4NV9zeuRjpAoSUA@mail.gmail.com>
In-Reply-To: <CAJCMAP7kZqNcrN-KdRPk=bUQqM4_jNpbd=D4NV9zeuRjpAoSUA@mail.gmail.com>
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit
Subject: Re: [PHP-DEV] Potential binary search optimization or feature
From: smalyshev@gmail.com (Stanislav Malyshev)

Hi!

> to utilize a binary search algorithm. Since the requirement for a binary
> search is that the array being searched is sorted, I thought is would be a
> good idea to have a Boolean parameter in the binary search function to
> specify if the input array should be sorted or not. something among the

Sorting array takes at least O(n*log n) (well, with comparison sort, but
that's what you'd have to use I assume), while linear search can be done
in O(n). So no profit here.
If you *know* the array is sorted, binary search function could be
useful, but I'm not sure how wide the use case for it would be.

> lines of "function binary_search(string target, array arrayToSearch, bool
> sort)". Doing this, the function can preform a sort if required to, thus
> not needing to sort a array that is already sorted.

Array function's name would have to start with array_ prefix.

-- 
Stas Malyshev
smalyshev@gmail.com