1. Design and analysis of parallel linear search algorithm
Authors : Rahul Sharma, Rohit Kumar
Pages : 35-38
DOI : http://dx.doi.org/10.21172/1.101.06
Keywords : array, data structure, linear, parallel, search, searching algorithm Abstract :Searching is an important operation that is performed on array. Searching is used in software development, web development and database to perform certain operation. Linear search algorithms is used to perform searching operations on array. In case of linear search, operation will be delayed when the size of array is large, and the search value is at the end of the array. This paper presents Parallel Linear search algorithm, which will help in performing the search operations faster. In each iteration, the algorithm compares four values of array with the search value and returns the index when the value of array matches with the search value. Search is performed from two directions, which makes it faster even if the value is at the last.
Citing this Journal Article :Rahul Sharma, Rohit Kumar, "Design and analysis of parallel linear search algorithm", Volume 10 Issue 1 - March 2018, 35-38
Click here to Submit Copyright Takedown Notice for this article.