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

2015 ◽  
Vol 121 (3) ◽  
pp. 13-17 ◽  
Author(s):  
Vimal P.Parmar ◽  
CK Kumbharana
Keyword(s):  
Search Algorithms ◽  
Binary Search ◽  
Linear Search ◽  
Linked List ◽  
Dynamic Array ◽  
Linear List

scholarly journals Binary Search In Linked List

2019 ◽  
Vol 8 (4) ◽  
pp. 2684-2686
Keyword(s):  
Time Complexity ◽  
Binary Search ◽  
Divide And Conquer ◽  
Linear Search ◽  
Linked List

This paper is based on an approach to implement Binary Search in Linked List. Binary Search is divide and conquer approach to search an element from the list of sorted element. In Linked List we can do binary search but it has time complexity O(n) that is same as what we have for linear search which makes Binary Search inefficient to use in Linked List. The main problem that binary search takes O(n) time in Linked List due to fact that in linked list we are not able to do indexing which led traversing of each element in Linked list take O(n) time. In this paper a method is implemented through which binary search can be done with time complexity of O(log2n). This is done with the help of auxiliary array. Auxiliary array helps in indexing of linked list through which one can traverse a node in O(1) complexity hence reducing the complexity of binary search to O(log2n) hence increasing efficiency of binary search in linked

scholarly journals Binary Search In Linked List

2019 ◽  
Vol 9 (1) ◽  
pp. 3151-3153
Keyword(s):  
Time Complexity ◽  
Binary Search ◽  
Divide And Conquer ◽  
Linear Search ◽  
Linked List

This paper is based on an approach to implement Binary Search in Linked List. Binary Search is divide and conquer approach to search an element from the list of sorted element. In Linked List we can do binary search but it has time complexity O(n) that is same as what we have for linear search which makes Binary Search inefficient to use in Linked List. The main problem that binary search takes O(n) time in Linked List due to fact that in linked list we are not able to do indexing which led traversing of each element in Linked list take O(n) time.In this paper a method is implemented through which binary search can be done with time complexity of O(log2n). This is done with the help of auxiliary array. Auxiliary array helps in indexing of linked list through which one can traverse a node in O(1) complexity hence reducing the complexity of binary search to O(log2n) hence increasing efficiency of binary search in linked List.

Pyramid Search: Skip Ring Data Structure-Based New Searching Algorithm

2018 ◽  
Vol 27 (14) ◽  
pp. 1850218
Author(s):  
Mustafa Aksu ◽  
Ali Karcı
Keyword(s):  
Data Structure ◽  
Time Complexity ◽  
Linear Search ◽  
Data Set ◽  
Linked List ◽  
Insertion And Deletion ◽  
Skip List ◽  
Algorithm And Data Structure ◽  
Text Element ◽  
Linked Lists

Our new algorithm and data structure, pyramid search (PS) and skip ring, were created with the help of circular linked list and skip list algorithms and data structures. In circular linked list, operations were performed on a single circular list. Our new data structure consists of circular linked lists formed in layers which were linked in a pyramid way. Time complexity of searching, insertion and deletion algorithms equal to [Formula: see text] (lg[Formula: see text]) in an [Formula: see text]-element skip ring data structure. Therefore, skip ring data structure is employed more effectively ([Formula: see text](lg[Formula: see text])) in circumstances where circular linked lists ([Formula: see text]) are used. The priority is determined based on the searching frequency in PS which was developed in this study. Thus, the time complexity of searching is almost [Formula: see text](1) for [Formula: see text] records data set. In this paper, the applications of searching algorithms like linear search (LS), binary search (BS) and PS were realized and the obtained results were compared. The obtained results demonstrated that the PS algorithm is superior to the BS algorithm.

scholarly journals COMPARISON OF SOFTWARE COMPLEXITY OF SEARCH ALGORITHM USING CODE BASED COMPLEXITY METRICS

2021 ◽  
Vol 6 (5) ◽  
Author(s):  
Bello Muriana ◽  
Ogba Paul Onuh
Keyword(s):  
Software Engineering ◽  
Programming Languages ◽  
Search Algorithm ◽  
Source Code ◽  
Search Algorithms ◽  
Binary Search ◽  
Software Systems ◽  
Software Complexity ◽  
Complexity Metrics ◽  
Binary Search Algorithm

Measures of software complexity are essential part of software engineering. Complexity metrics can be used to forecast key information regarding the testability, reliability, and manageability of software systems from study of the source code. This paper presents the results of three distinct software complexity metrics that were applied to two searching algorithms (Linear and Binary search algorithm). The goal is to compare the complexity of linear and binary search algorithms implemented in (Python, Java, and C++ languages) and measure the sample algorithms using line of code, McCabe and Halstead metrics. The findings indicate that the program difficulty of Halstead metrics has minimal value for both linear and binary search when implemented in python. Analysis of Variance (ANOVA) was adopted to determine whether there is any statistically significant differences between the search algorithms when implemented in the three programming languages and it was revealed that the three (3) programming languages do not vary considerably for both linear and binary search techniques which implies that any of the (3) programming languages is suitable for coding linear and binary search algorithms.

Time distribution analysis for binary search of a linked list

1991 ◽  
Vol 23 (4) ◽  
pp. 7-12
Author(s):  
Firooz Khosraviyani ◽  
Mohammad H. Moadab ◽  
Douglas F. Hale
Keyword(s):  
Time Distribution ◽  
Binary Search ◽  
Distribution Analysis ◽  
Linked List

scholarly journals FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION

2001 ◽  
Vol 09 (06) ◽  
pp. 827-837 ◽  
Author(s):  
R. TREJO ◽  
J. GALLOWAY ◽  
C. SACHAR ◽  
V. KREINOVICH ◽  
C. BARAL ◽  
...  
Keyword(s):  
Computation Time ◽  
Binary Search ◽  
Planning Problem ◽  
Linear Search ◽  
Worst Case ◽  
Average Complexity ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Long Time ◽  
Speed Up

If we want to find the shortest plan, then usually, we try plans of length 1, 2, …, until we find the first length for which such a plan exists. When the planning problem is difficult and the shortest plan is of a reasonable length, this linear search can take a long time; to speed up the process, it has been proposed to use binary search instead. Binary search for the value of a certain parameter x is optimal when for each tested value x, we need the same amount of computation time; in planning, the computation time increases with the size of the plan and, as a result, binary search is no longer optimal. We describe an optimal way of combining planning algorithms into a search for the shortest plan – optimal in the sense of worst-case complexity. We also describe an algorithm which is asymptotically optimal in the sense of average complexity.

scholarly journals Development Binary Search Algorithm

2011 ◽  
Vol 8 (2) ◽  
pp. 625-629
Author(s):  
Baghdad Science Journal
Keyword(s):  
Search Algorithm ◽  
Search Algorithms ◽  
Binary Search ◽  
Search Process ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Order Of Magnitude ◽  
Binary Search Algorithm ◽  
Search Interval

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case complexity of Search) is O(log2 n) (pronounce this "big-Oh-n" or "the order of magnitude"), if we search in a list consists of (N) elements. In this research the number of comparison is reduced to triple by using Triple structure, this process makes the maximum number of comparisons is O(log2 (n)/3+1) if we search key in list consist of (N) elements.

scholarly journals English Myanmar Dictionary System by Using Linear and Binary Search Techniques

2020 ◽  
pp. 209-217
Author(s):  
Myo Ma Ma ◽  
Yin Myo KKhine Thaw ◽  
Lai Lai Yee
Keyword(s):  
English Language ◽  
Binary Search ◽  
Linear Search ◽  
Search Methods ◽  
Unknown Word ◽  
Part Of Speech ◽  
System Output ◽  
Language User ◽  
Searching Method ◽  
Cross Reference

This paper is aimed to develop a searching method based on binary search and linear search as well as to understand the finding of search methods. The system searches the desired word for English to English and English to Myanmar. The system may help the English may help the English Language user enable to know the desired word of English and Myanmar meaning. The system output is searching word of English meaning, Myanmar meaning, part of speech, searching time and step. And also, the system finds cross reference and user's unknown word by using binary search and linear search of searching algorithm. This system is implemented by using ASP.NET platform.

Sign in / Sign up

Export Citation Format

Share Document