Re: Tree sort in C
| From: | Brian Moon | Date: | Wed, 09 May 2007 17:43:34 +0000 |
| Subject: | Re: Tree sort in C | ||
| References: | 1 2 3 4 5 6 | Groups: | php.internals |
| Request: | Send a blank email to internals+get-29381@lists.php.net to get a copy of this message | ||
Derick Rethans wrote:
On Wed, 9 May 2007, Maurice Makaay wrote:Me too. But, fwiw, the multisort method does not do the same thing. So, its apples to oranges. See my other email. In the apples to apples comparisons with use the same algorithm in PHP and in C, the C version is always faster. -- Brian Moon Senior Developer ------------------------------ http://dealnews.com/ It's good to be cheap =)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.