Closest Common Type
svv1999 at hotmail.com
Sat May 17 07:26:52 PDT 2008
> with a little insight from #D:
Would you please describe your (hopefully) real world case of usage.
I beg for this, because your algorithm has a worst case lower bound for
the run time of
| Omega( n * N)
and---if N is fixed---the fastet algorithm has a worst case lower bound
for the runtime of
| Omega( n + N);
where n is the number of queries to the derivation tree and N is the
number of nodes in the derivation tree.
More information about the Digitalmars-d-learn