International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 121 - Number 3 |
Year of Publication: 2015 |
Authors: Vimal P.parmar, Ck Kumbharana |
10.5120/21519-4495 |
Vimal P.parmar, Ck Kumbharana . Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List. International Journal of Computer Applications. 121, 3 ( July 2015), 13-17. DOI=10.5120/21519-4495
Information retrieval is the most fundamental requirement for any kind of computing application and which requires search operation to be performed from massive databases implemented by various data structures. Searching an element from the list is the fundamental aspects in computing world. Numbers of algorithms are developed for searching an element among which linear search and binary search are the most popular algorithms. In this paper researcher has made efforts to compare these both algorithms to implement on various data structures and to find out the solution to implement binary search on linked linear list. This paper also analyzes both the algorithms at some extent for the applicability and execution efficiency. This paper also analyzes the few data structures to implement these algorithms. At last based on the linear search and binary search algorithms, one algorithm is designed to function on linked linear list.