> 1. (Self-balancing binary trees). The idea here is that a balanced binary
> tree has worst-case insertion time O(log N), while the linked list we
> normally use has worst-case insertion time O(N). This means that the
> worst-case execution time for N insertions into a hashtable goes from
> O(N^2)
On 29/11/15 04:44, Levi Morrison wrote:
>> A multicore php8 or php9? Wouldn't be cool
> Honestly, PHP is a poor language for parallel computing. This is
> because PHP is a web-focused language. The the most common setup ends
> up with a blocking request on a network call. What we really need i
On Sat, Nov 28, 2015 at 12:02 PM, Pascal KISSIAN
wrote:
> Sorry Nikita,
>
>
>
> I didn’t fully read your 1st message because it was speaking on changing
> hash algo…, and I’ve been a bit lazy on that…
>
>
>
> However, I only have thought about a minor change introducing a salt.
>
> In the zend_in
