thanks, paul.
if i understand correctly, questions about "about how intricate [an]
algorithm [is] (this affects its difficulty of implementation and
understanding)" are also fair and deserve fair answers.
again, if i understand correctly, this issue gets its share of
attention in computer sciences, and cs teachers discuss it in class,
passing along their own appreciation of it to their students.
- james
Quoting Paul Rubin <"http://phr.cx"@NOSPAM.invalid>:
ja...@biosci.utexas.edu writes:
donald knuth's anaylses of the computational complexity of algorithms
I think the question was about how intricate the algorithm was (this
affects its difficulty of implementation and understanding), not its
computational complexity.
--
http://mail.python.org/mailman/listinfo/python-list
--
http://mail.python.org/mailman/listinfo/python-list