| Current Forum: Homework 5 - Part 3 |
| Date: Sat Nov 17 2001 7:06 pm |
| Author: Goodman, Brian J. <bjg@andrew.cmu.edu> |
| Subject: Re: Output of results |
|
|
Yes, that's correct. We don't expect you to write something to compete with google.
As far as the quickness, remember that the n in O(log n) in the writeup is the number of keywords and pages in the index. As long as your solution is O(f(z)) rather than O(f(n)) where n is the total number of pages & keywords in your index and z is the
number of pages *returned* for this particular query, you should be fine. |
|