Hierarchical <ul><li> from MySql

[eluser]zerone[/eluser]
[quote author="Grahack" date="1198000802"]This is all about recursion.
Here is an example to compute n!=nx(n-1)x(n-2)x...x4x3x2x1.

Code:

<?php
function facto($n)
{
   if ( $n == 1 ) return 1;
   else return $n * facto( $n - 1 );
}

[/quote]

Indeed
It would be achieved by iteration, but this problem requires tree recursion.
But iteration is far more efficient.