11. In computer world, there are many search algorithms to help us in search information on the internet or in database.

One of search algorithm is best-first search, the algorithm for producing referring expressions that identify sets of objects. On this best-first search algorithm, Horacek (2003) in his paper states that the power of the algorithm comes from linguistically motivated restriction and preferences, and from a variety of cut-off techniques. Unlike best-first algorithm, The Variable Neighborhood Search (VNS) is a metaheuristic and solves optimization problems by doing systematic changes of neighborhood within a local search (Mladenovic and Hansen, 1997). The best use of search algorithm is search engine. Search engine enable us to search information quickly and efficiently. Bar-Yossef and Guverich (2008a) in their paper, use method to mining search engine query logs via suggestion sampling. They state in their paper about their method Generating each sample suggestion using our methods r equires sending a few thousands of queries to the suggestions server. While this may seem a high number, in fact when submitting the queries sequentially at sufficiently long time intervals, the added load on the suggestion server is marginal. But later they discovered about random sampling from search engine index. This random sampling can be used not only by third parties, but also by search service providers themselves to test the quality of their search engines and to compare them against the competition (Bar-Yossef and Guverich, 2008b). Another use of search algorithm is in biological application. Mao, et al. (2005) state about distance-based method, In biological applications a primary advantage on distance-based methods is that they may be used to capture similarity of data that is not naturally described by a point in a Euclidean space. Although search algorithm can be used in many ways, Choudhary, Kalmegh, and Desmukh (2013) said that Google Research Lab has worked out many generic algorithms however they are successful in certain conditions only. A focus on personalization of semantic search where in one can restrict the domain set and search parameters depending on the personal information. Different from Google that provides a link for the answer of the search, Facebook maker, Zuckerberg, use Graph Search for his Facebook. Graph Search is designed to take precise query and give you answer, rather than links that might provide the answer (Anon., 2013). Another assumes about search algorithm that searching algorithms are closely related to the concept of dictionaries, because dictionaries are data structures that support search, insert, and delete operations, and one of the most effective representations is a hash table (Softpanorama, 2013). And in their website, Softpanorama (2013) said about method called cache-based: several recently used keys are stored a special data structure that permits fast search (for example, located at the top and/or always sorted). Beside all of method, we can choose the best one for our case, because each method has a special advantage in different cases.