Re: Tree sort in C
| From: | Derick Rethans | Date: | Wed, 09 May 2007 17:28:26 +0000 |
| Subject: | Re: Tree sort in C | ||
| References: | 1 2 3 4 5 | Groups: | php.internals |
| Request: | Send a blank email to internals+get-29379@lists.php.net to get a copy of this message | ||
On Wed, 9 May 2007, Maurice Makaay wrote:
> At a really
> large number of nodes, the extension becomes slower, but the memory stays low.
That is very peculiar... it should never be slower than an
implementation in PHP - unless your algorithm isn't optimal.
regards,
Derick