Newsgroups: php.internals
Path: news.php.net
Xref: news.php.net php.internals:29387
Mailing-List: contact internals-help@lists.php.net; run by ezmlm
Received-SPF: pass (pb1.pair.com: domain googlemail.com designates 64.233.184.234 as permitted sender)
DomainKey-Status: bad
DomainKey-Signature: a=rsa-sha1; c=nofws;
        d=googlemail.com; s=beta;
        h=received:message-id:date:from:reply-to:to:subject:cc:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references;
        b=nbqnu3q7sOfLsTRx0xvWXBm8UHQALYjhh4DKbMCbS7eulTr7WODRsh3hR3wxehZEq1OivonmPAUAoprNeJURHovuU2LwuUaDJSNStDFHxu1CMw+Q8zSQPbBHbh1IbjqEQ4fL2VAugb6PjWE2hHyQqvt1AB7OR7YVp37Ma6412ss=
Message-ID: <10845a340705100139t7d3b4859vd9b405b6147d5e02@mail.gmail.com>
Date: Thu, 10 May 2007 09:39:04 +0100
Reply-To: RQuadling@GoogleMail.com
To: "Brian Moon" <brianm@dealnews.com>
Cc: "Derick Rethans" <derick@php.net>, "Maurice Makaay" <maurice@phorum.org>, 
	"Michael Walter" <michael.walter@gmail.com>, internals@lists.php.net
In-Reply-To: <46420846.8020502@dealnews.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
References: <4641D92C.4050208@dealnews.com>
	 <10845a340705090743v6aba7896y45b9f7d60a4e77ba@mail.gmail.com>
	 <4641E3DD.8040807@phorum.org>
	 <877e9a170705090913i320359cag81b0a3bf203e2c86@mail.gmail.com>
	 <464202D9.8080509@phorum.org>
	 <alpine.DEB.0.98.0705091927300.15448@kossu.ez.no>
	 <46420846.8020502@dealnews.com>
Subject: Re: [PHP-DEV] Tree sort in C
From: rquadling@googlemail.com ("Richard Quadling")

On 09/05/07, Brian Moon <brianm@dealnews.com> wrote:
> Derick Rethans wrote:
> > 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.
>
> 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.
>

I agree with Brian here, the code I referenced was an array multisort
by column which I created based upon user notes on the array_multisort
function. You do not require a trawl through to get the list of "keys"
like is done here.

So,

$sorted = array_multisort_column($nodes, 'parent_id', 'id');

It is a single pass mechanism. It uses the indexes supplied to compare
them in sequence. A simple bubble sort.

BUT this is not a tree sort as this is something quite different. The
array_multisort() nor my array_multisort_column() functions will not
work for more than 1 level of parent/child relationships.

Richard


> --
>
> Brian Moon
> Senior Developer
> ------------------------------
> http://dealnews.com/
> It's good to be cheap =)
>


-- 
-----
Richard Quadling
Zend Certified Engineer : http://zend.com/zce.php?c=ZEND002498&r=213474731
"Standing on the shoulders of some very clever giants!"