On Tue, Jul 20, 2004 at 09:49:07AM -0500, Michael Sims wrote:
> above is necessary. If you merely need to traverse $bit_array without actually
> modifying it then I suspect a simple foreach would be much faster, but I'm probably
> missing something...
Ah, I just changed that and now it's a hundre
Sven Riedel wrote:
> letters "0" and "1". My tree-traversal algorithm looks like this:
>
> $bit_array = str_split( $bitstring );
> $tree_climber = $tree; // assign tree-climber to the
> tree root
>
> // main loop
> while( !is_null( $bit = array_shift( $bit_array ) ) ) {
> $tr
Hi,
I'm currently struggleing with trees built from arrays of arrays and their
performance. During tree traversal php spends a frightening amount of time in
there, which (I guess) is due to the way the tree is constructed.
What I have is an unbalanced binary tree, the inner nodes of which are
en
3 matches
Mail list logo
