searching -"the anatomy of large-scale hypertextual web search engine, brin and page search algorithms can be classified in number of ways is the underlying collection static or dynamici inserts and deletes are interleaved with searchingis it worth spending the computational cost to preprocess the data so as to speed up subsequent queriesare there statistical properties of the data that can be exploitedshould we operate directly on the data or transform itin this our focus is on static data stored in sorted order in an array data structures appropriate for dynamic updates are the subject of and the first collection of problems in this are related to binary search the second collection pertains to general search