ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

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:

Authors : ; ;

Page : 751-758

Keywords : Sequential Search; Binary Search; Hashing; Hash function; Comparisons; Application; Time Complexity;

Source : Downloadexternal Find it from : Google Scholarexternal


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.

Last modified: 2014-07-29 02:27:29