CFP last date
22 July 2024
Reseach Article

Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List

by Vimal P.parmar, Ck Kumbharana
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

@article{ 10.5120/21519-4495,
author = { Vimal P.parmar, Ck Kumbharana },
title = { Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 121 },
number = { 3 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 13-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume121/number3/21519-4495/ },
doi = { 10.5120/21519-4495 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:07:28.662461+05:30
%A Vimal P.parmar
%A Ck Kumbharana
%T Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List
%J International Journal of Computer Applications
%@ 0975-8887
%V 121
%N 3
%P 13-17
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. An Introduction to data structures with applications - (Mcgraw Hill Computer Science Series) [Jean-Paul Tremblay, Paul G. Sorenson, P. G. Sorenson]
  2. International Journal Of Innovative Research In Technology © 2014 IJIRT | Volume 1 Issue 5 | ISSN: 2349-6002 IJIRT 100392 800 BINARY SEARCH ALGORITHM Ancy Oommen , Chanchal Pal
  3. Binary Search on linked List – a research project in experimental computer science - Marcin Paprzycki, Firooz Khosraviyani, bark Wagaman Department of mathematics and computer science The university of Texas of the Permian basin Odessa Tx 79762
  4. A Randomized Searching Algorithm and its Performance analysis with Binary Search and Linear Search Algorithms - The International Journal of Computer Science & Applications (TIJCSA) - Volume 1, No. 11, January 2013 ISSN – 2278-1080
  5. Modified Binary Search Algorithm for Duplicate Elements- P PhyuPhyu Thwe, Lai Lai Win Kyi International Journal of Computer & Communication Engineering Research (IJCCER) Volume 2 - Issue 2 March 2014
  6. Analysis of Linear and Binary Search Algorithm – Sapinder, Ritu, Arvinder Singh. International Journal of Computers & Distributed Systems www. cirworld. com Volume 1, No. 1, Jun 2012
  7. Linear Search versus Binary Search: A statistical comparison for binomial inputs- Anchala Kumari1, Rama Tripathi2, Mita Pal3 and Soubhik Chakraborty, International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol. 2, No. 2, April 2012
  8. Binary Search Tree Balancing Methods: A Critical Study Suri Pushpa1, Prasad Vinod IJCSNS International Journal of Computer Science and Network Security, VOL. 7 No. 8, August 2007
  9. BINARY SEARCH ALGORITHM, Ancy Oommen , Chanchal Pal, 2014 IJIRT | Volume 1 Issue 5 | ISSN: 2349-6002
  10. Searching Large Indexes on Tiny Devices Optimizing Binary Search with Character Pinning
Index Terms

Computer Science
Information Sciences

Keywords

Linear Search Binary Search Static array Dynamic array Linked List Binary Search Tree Time Complexity Algorithm Efficiency Algorithm Analysis