| Current Forum: Homework 5 General Forum |
| Date: Mon Nov 5 2001 4:53 pm |
| Author: Shi, Ying <shy@cmu.edu> |
| Subject: O(lgN) time requirement for search |
|
|
in the write-up: "...you are required to use an approach so that searching runs in O(lgN) time, where n is the number of keywords and web pages in the index structure..."
so, suppose there are i keywords and j webpages in the index structure, does it mean O(lg(i+j)) time is required ??
thanks! |
|