| I don't really consider this much of an improvement-- set intersection isn't *that* much harder to implement than set union. However, extra credit would certainly be in order if anyone would like to create a full blown search engine. This can mean whatever you'd like it to within reason, but features I'd certainly expect would be set union, set intersection, and set subtraction (I should be able to throw out all pages with some "bad" keyword from my set of results). If you do this, please do the simple search that I described in an earlier post and then put your extra credit (along with documentation of how to use it) in a separate java file like WebSearch2.java. |