> O(log n) binary trees require a total order on the putative
> elements, which would need to come from somewhere.

Yes, I was sleeping (and dreaming of another situation than this one).
Sorry, and thanks for pointing it out.

_______________________________________________
Scheme-reports mailing list
Scheme-reports@scheme-reports.org
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports