A Comparison and Selection on Basic Type of Searching Algorithm in Data Structure?
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 7)Publication Date: 2014-07-30
Authors : Kamlesh Kumar Pandey; Narendra Pradhan;
Page : 751-758
Keywords : Sequential Search; Binary Search; Hashing; Hash function; Comparisons; Application; Time Complexity;
Abstract
A lot of problems in different practical fields of Computer Science, Database Management System, Networks, Data Mining and Artificial intelligence. Searching is common fundamental operation and solve to searching problem in a different formats of these field. This research paper are presents the basic type of searching algorithms of data structure like linear search, binary search, and hash search. We have try to cover some technical aspects to this searching algorithm. This research is provides a detailed study of searching algorithms working process, select on Searching Algorithm according To Problem and compares them on the basis of different parameters like total number of comparison, type of data Structure, time complexity and space complexity.
Other Latest Articles
- HUMAN IDENTITY AS A MOTIVATION FACTOR OF ECONOMIC ACTIVITY (Bookreview: George, A. Akerlof. Identity Economics: How our identities shape our work, wages and well-being)
- IMPROVEMENT OF THE STATE CADASTRAL VALUATION OF LANDS (THE CASE STUDY OF THE VOLGOGRAD REGION)
- RESEARCH AND PROSPECTS PRESERVATION OF STEPPE CALCIPHILOUS LANDSCAPES IN THE VOLGOGRAD REGION
- CURRENT STATE AND TENDENCIES OF INVESTMENT COOPERATION OF RUSSIA AND EUROPEAN UNION
- SYSTEM OF TARIFF PREFERENCES OF CUSTOMS UNION
Last modified: 2014-07-29 02:27:29