Re: Faster zend sorting implementation
| From: | Tim Düsterhus | Date: | Mon, 05 Jan 2015 18:15:28 +0000 |
| Subject: | Re: Faster zend sorting implementation | ||
| References: | 1 | Groups: | php.internals |
| Request: | Send a blank email to internals+get-80194@lists.php.net to get a copy of this message | ||
Sorry if someone receives this reply twice. I sent it by a different
alias by accident and apparently the sender confirmation does not work
properly.
On 05.01.2015 18:08, Xinchen Hui wrote:
> do you think such BC break is acceptable? or I still need a RFC?
>
Chiming in as a pure userland developer. The documentation already states:
> Note: Like most PHP sorting functions, sort() uses an implementation
of » Quicksort. The pivot is chosen in the middle of the partition
resulting in an optimal time for already sorted arrays. This is however
an implementation detail you shouldn't rely on.
As the selection of the pivot element may also affect the order of equal
elements and is explicitly defined as “one should not rely on it” this
change seems to be fine from my perspective.
Tim