|
Seems like a good final project for an undergrad recursive algorithms class. Starting at [url=http://en.wikipedia.org/wiki/Portal:Contents/A%E2%80%93Z_index] this page, write a program to determine if there are any entries that do not lead to Philosophy. Give the optimal order of time complexity in Big-O notation.
__________________
'He who receives an idea from me, receives instruction himself without lessening mine; as he who lights his taper at mine, receives light without darkening me.'
-TJ
|