See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/314175061

A Brief Study and Analysis of Different Searching Algorithms

Conference Paper · February 2017

CITATION READS

1 2,135

4 authors, including:

Najma Sultana Sourabh Chandra

Calcutta Institute Of Technology ,Kolkata,India Calcutta Institute of Technology, Kolkata
4 PUBLICATIONS   6 CITATIONS    39 PUBLICATIONS   107 CITATIONS   

SEE PROFILE SEE PROFILE

Sk Safikul Alam
Jubilant Life Sciences
37 PUBLICATIONS   107 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

[Elsevier] Intelligent Environmental Data Analysis and Pollution Management View project

SENTIMENT ANALYSIS FOR PRODUCT REVIEW View project

All content following this page was uploaded by Sourabh Chandra on 02 March 2017.

The user has requested enhancement of the downloaded file.

 2017 SECOND IEEE INTERNATIONAL CONFERENCE ON E LECTRICAL , COMPUTER AND COMMUNICATION T ECHNOLOGIES

A Brief Study and Analysis of Different

Searching Algorithms
Najma Sultana Smita Paira
Dept. of Computer Science and Engineering Dept. of Computer Science and Technology
Calcutta Institute of Technology, Uluberia IIEST, Shibpur
Howrah, India Howrah, India
najma.cse@gmail.com smtpaira@gmail.com

Sourabh Chandra Sk Safikul Alam

Dept. of Computer Science and Engineering Dept. of Computer Science and Engineering
Calcutta Institute of Technology, Uluberia Calcutta Institute of Technology, Uluberia
Howrah, India Howrah, India
sourabh.chandra@gmail.com mail2safikul@gmail.com

Abstract— This paper presents the review of certain
important and well discussed traditional as well as
proposed search algorithms with respect to their time
complexity, space Complexity , merits and demerits
with the help of their realize applications. This paper
also highlights their working principles. As it is well
known that every sorted or unsorted list of elements
requires searching technique so many search
algorithms have been invented. Among traditional
search algorithms, a comparison table has been made
in order to check and establish their benefits and
drawbacks. Among some of the well known proposed
search algorithms like fast string searching algorithm,
multiple solution vector approach and bi linear search
etc, a comparison has also been made.
types of search algorithms used to search an element from
a set of elements. Search algorithm includes both
traditional search algorithm i.e. which are used very
frequently and proposed search algorithms i.e. the search
algorithms which are proposed by the researcher's
recently .Traditional search algorithms are like linear
search[2], binary search[1] , interpolation search[16] and
jump search[12] . There are some proposed search
algorithms too, as network localization using tree search
algorithm, a fast string searching algorithm etc[14].
Though there are many search algorithms, we have
discussed and compared some of the useful, efficient
algorithms in the following sections. Time complexity
analysis has been made in order to compare them
perfectly.

Keywords—Network localization; tree search; BPCF; II. THEORITICAL REVIEW ON

harmony search; SOS; Best first search; LR-LD
I. INTRODUCTION
Searching is one of the basic operations of Data Structure,
which is used to find a particular data from a list of data.
Searching can operates both on sorted and unsorted list of
elements. Depending on the type of data structure, a
suitable search algorithm is chosen .There is so many
TRADITIONAL SEARCH ALGORITHMS
In this section , we have made an comparison study on the
four traditional search algorithms namely linear search ,
binary search ,interpolation and jump search .The
comparison study on these algorithms are based on the
features, time complexity analysis, merit and demerit
respectively. The Table I below briefs about the study.

Table I. Comparison Table of Traditional Search Algorithms

Algorithm Linear Search Binary Search Interpolation Search Jump Search
Features Sequentially checks the Also known as half Improved variant of Also known as Block
target element in the listInterval search or Binary search. Works search, Where step
until and unless it is logarithmic search on the probing number is calculated
found or all the elements Which follows divide position of required from the list length
are checked [3]. and Reduce method. value to search a and searching is done
particular data from a in some interval of
list. Works only on blocks.
sorted elements.
Time Complexity Best case=O(1) Average Best case =O(1) Best case =O(1)
Analysis case=O(n) Worst Average Case =O(log Average Case

944 978-1-5090-3239-6/17/$31.00 © 2017 IEEE

 2017 SECOND IEEE INTERNATIONAL CONFERENCE ON E LECTRICAL , COMPUTER AND COMMUNICATION T ECHNOLOGIES

Algorithm Linear Search Binary Search Interpolation Search Jump Search

case=O(n)
Merit Easy to understand,
implement and Resource
efficient. Works on both
sorted and Unsorted
elements.
Demerit Is not very efficient than
binary and interpolation n
search as it requires lot of
Comparison s to find a
particular data.
n) Worst Case =O(log =O(log(log n)) Worst
n) case=O(n)
Average case and Execution time for It is very useful When
worst case order are Average case is Much jumping back is
better than that of lower than linear and significantly lower
linear search. Worst binary search. than jumping
case order is also forward. More
better than interpolate efficient than linear
on search. search.
Works only on sorted Works only on Sorted Works only on Sorted
elements. elements and worst elements.
case is n iterations Implementation of
This approach is
Considered to be
More difficult than
Binary search.

Linear search is a sequential search which checks each
and every element of the entire list to search a particular
data from the list. It is an easy, resource efficient
algorithm which can work on both sorted and unsorted list
of elements. Binary search or logarithmic search is a more
efficient search algorithm to search a particular data from
a sorted list of data. Determines the middle position of the
list and search accordingly either in left or right of the
middle. Worst case and average case orders are much
appreciable than linear search.
Interpolation search or improved variant binary search
works by calculating the probing position in the list.
Average case execution time is very much noticeable O
(log n).Thus is a helpful algorithm when the search value
is of average one. Jump search algorithm refers to a search
in sorted list of elements. It is also known as block search
as it uses a minimum gapping value or length to search a
particular data. It overcomes the demerits of sequential
search for worst case scenario.
execution value for best case but for worst case it takes
much more time to execute the program.
Bi Linear search a new session of searching was proposed
by researchers Smita Paira et al. in the year 2014.The
algorithm works on both sorted and unsorted list of
elements. As the name suggest that is Bi Linear, searching
propagates at both the ends of the list for a search item in
the list thus its worst case scenario is far better than other
search algorithms. The researchers Phisan Kaewprapha et
al. proposed a search algorithm named Network
localization using tree search in the year 2016, the
algorithm is a heuristic process which works under the
presence of anchor nodes (nodes, whose locations are well
known) to find the locations of desired unknown nodes
[6]. The addition of a new node in the existing list is done
by traversing and checking it’s compatibility for
neighboring nodes and non neighboring nodes. Apart
from solving a problem faster this method do not promises
to be optimal.

III. REVIEW ON SOME RECENTLY Researchers Sankar Peddapati et al. proposed an

PROPOSED SEARCH ALGORITHMS
In this section some of the well discussed proposed search
algorithms have been described in short along with the
table of comparison. These are as follows:
A fast string searching algorithm was proposed by
researchers Robert S Boyer et al. in the year 1977, which
the foresights the string being searched for. The basic
knowledge behind the working of this algorithm is that
more information is gathered by matching the pattern
from right than from the left of the string .If the last
character of the searched character name is matched then
it will examine the second last of the character name and
so on until we get a positive result or terminating the
process getting a negative output thus work as a
determinative process [4]. This method has a low
algorithm on multiple solutions vector approach in the
year 2016.The term multiple solution is an area multiple
criteria decision making. Vector approach of multiple
variable problems can be solved comparing a large
number of generated solutions with the position of best
solution vector. If the random number so generated is less
than the best position consideration factor (BPCF) the
new solution are evaluated from the best individual
solution. Along with the merit of solving a multiple
variable problem easily it has a demerit of having high
value of execution time.
An iterative way of searching named unsupervised feature
selection technique based on harmony search was
proposed in the year 2016 by researchers Laith
Muhammad Abualigah et al. It improves the text
clustering technique by means of random search
technique. It works on its corresponding parameters

945
 2017 SECOND IEEE INTERNATIONAL CONFERENCE ON E LECTRICAL , COMPUTER AND COMMUNICATION T ECHNOLOGIES
following the storage of solutions in the harmony memory
matrix. Invention of a new solution takes place following
certain rules, if the new solution is far better than the
previous one it will replace that otherwise not. When
harmony search reaches its maximum value of iterations
the process will terminate and the HMCR and PAR
parameters will help in searching global and local
solutions. This algorithm beats other text clustering
techniques through improved performances of fast
information retrieval. The foremost drawback of this
algorithm is that it performs well only in a limited area.
Bid based economic dispatch using symbiotic organisms
search algorithm was proposed by researchers Archana
Tiwari et al. In the year 2016, which says that the
economic load dispatch problem that is the maximization
criteria of social profit while satisfying different
constraints like power balance, generator bid and
customer bid quantities can be done using symbiosis
technique [15] .The word symbiosis refers to the
relationship between two different species .SOS a
metaheuristic process, works on the principle of survival
of the fittest. The fittest species will eradicate the other
and occupy its position. The algorithm works by
calculating mutualism vector, commensalism function or
parasitism vector and benefit factor(BF).SOS attempts to
move a population, called ecosystem of possible solutions
to promising areas of the search space during the search
for optimal solution for which social profit respecting the
generation cost and customer demand will be higher. Has
no algorithm specific parameters thus easy to understand
and compute [19].May produce result with little bit error
(as it is a meta-heuristic process).
Researchers Kashale Chimmanga et al. proposed a search
Table II. Comparison of Proposed Search Algorithms
Method Feature
Fast string Searches for the pattern in the text
searching from backward direction i.e. first
algorithm searches for the right positioned
character of the pattern and
continues to search for the initial
characters. [13]
Bi-linear search Modified form of linear search.
algorithm Search bidirectionally i.e.
searching starts from both the ends.
Along with best case order worst
case order is also of 1.
946
algorithm i.e. an application of best first search algorithm
to demand control in the year 2016 to minimize the
deficiency of electricity in Zombia. The algorithm
searches for the best combination of household appliances
according to their power rate and ranking. System
continuously checks for the power of PV system and
matches whether the said combination of appliances input
demand matches with the supply or not. Algorithm runs
through each and every appliances and alerts the user
which appliance should be switched on or off as per their
priorities. The priority (represented by a number) is given
by the user. The system is prepared in such a way that it
tells when the consumer is connected to the electricity
grid or not. The main advantage of Best first search
algorithm over Breadth first search algorithm is that as it
uses heuristic functions it is applicable for large number
of appliances and produces result much faster[20]. But
sometimes the result may be disvalued if the heuristic
function so produced contains some errors.
A nearest neighbor search algorithm for LR-LD on high
SNR was proposed by researchers Thae Thae Yu Khine et
al. in the year 2016, this algorithm includes two parts that
is derivation of unimodular matrix and feasible detection
of symbols. But mainly focuses on the second drawback
of lattice reduction (LR) technique (feasible set of the
detected symbol cannot be found without huge
operation)[18].It produces feasible set of detected symbols
without lesser amount of procedures and calculations .The
algorithm work same as of previous LR algorithm to
derive the unimodular(matrix having perpendicular
vectors) matrix[11].Its operation is easy and execution
time is much lower. The table for various proposed search
algorithms is described in Table II below:-
Merit Demerit
Execution time for best case If the pattern is not present
is much lower than other in the text i.e. worst case
similar type of string execution time is much
searching algorithms. higher than other string
searching algorithms.
Unable to search for a
numeric value in the text.
It does not work efficiently
for small alphabets like
DNA.
Works on both sorted and -
unsorted list of elements [5].
Worst case run time is of
O(1) which is far better than
the worst case run time of
linear, binary, interpolation
and jump search algorithms.
 2017 SECOND IEEE INTERNATIONAL CONFERENCE ON E LECTRICAL , COMPUTER AND COMMUNICATION T ECHNOLOGIES

Method Feature Merit Demerit

Network Heuristic process of determination. Produces faster result Output is not much
Localization n Works in presence of anchor nodes, .Efficient in terms of memory optimal as it is a heuristic
using Tree search uses compatibility factor to localize usage [23]. process of searching.
algorithm certain unknown nodes. Promises
to be faster enough
Multiple solution Generates N numbers of random Solves confined optimization Execution time is higher as
vector Approach solutions. Identifies best solution problem easily where it requires many
and replaces it by the previous one. multiple variables are present. calculations.
[7]
Unsupervised Uses random search technique Beats other text clustering Has limited scope, only
feature Selection [21]. Invention of new solutions Techniques through Improved being accessible within a
technique based on takes place following certain rules. performance of fast certain portion.
Harmony search The process terminates when it information retrieval [8].
algorithm reaches its maximum iteration.
Bid based Meta-heuristic in nature. The It is simple, easy to Do not produce accurate or
economic dispatch method follow some formulations understand. Has less optimal result every time.
Using symbiotic like objective functions and computational time than
organisms Search constraints (power balance, Other algorithms like
algorithm generator bid quantities and simulated annealing and
customer bid quantities constraints) genetic algorithm [9]. It has
[22]. no algorithm specific
parameters.
Based on the symbiotic relationship
a particular algorithm
(commensalism, mutualism or
parasitism) is chosen
Application of best Maximizes use of energy from For a number of appliances it Greedy in nature, i.e. may
first search solar source than from the is found to be more efficient lead to a solution very
algorithm to economic grid. Follows some in Searching optimal quickly with some errors if
demand control heuristic information to select the appliances Combinations than heuristic functions are not
better appliances combinations in breadth first search algorithm. optimal.
order to minimize power demand
[10]. It also helps the user to select
own appliance combinations and
do switch on/off according to the
power generate.
A nearest neighbor Derivation of unimodular matrix is Operation is simpler and
Search algorithm same as in case of other LR Time complexity is minimal
for LRLD on high methods. Evaluation of optimal set than the previous LR-LD
SNR of detected symbol from unknown algorithm.
transformed symbols is done
quickly.

IV. CONCLUSION demerits in order to have optimal search algorithms for

Searching is one of the important operation of data
structure. Different searching algorithms enable us to look
for a particular data from the entire list. Traditional search
algorithms are well known for their basic characteristics
like searching a data from array index i.e. either from
sorted list(like binary search, interpolation search and
jump search)or from unsorted list of elements like Linear
search algorithm [17]. Different proposed search
algorithms have been also discussed whose working are
unique and condition specific i.e. they have been meant
for a particular job. The merits of each and every
algorithm are highly appreciable but we cannot ignore
their drawbacks. Researchers should focus on those
accurate and fast search operations in near future.
REFERENCES
[1]. Data structure using C by Reema Thareja(first published
2011 by Oxford University Press) in INDIA Ram Book
Binding House,New Delhi.
[2]. Data structures using c and c++ by Yedidyah
langsam,Aaron M. Tenenbaum second Indian printing
(Prentice Hall of India private limited) New Delhi-
110001.
[3]. Data Structures by Seymour Lipschutz and G A
Vijayalakshmi Pai (Tata McGraw Hill companies).
[4]. R S Boyer and J Srother Moore, “ A fast string searching
algorithm”,Communication of the association for

947
 2017 SECOND IEEE INTERNATIONAL CONFERENCE ON E LECTRICAL , COMPUTER AND COMMUNICATION T ECHNOLOGIES
computing machinery Inc.20(10),1977, vol-20,pp. 762-
772.
[5]. Smita Paira,Sourabh Chandra,Sk Safikul Alam and
Subhendu Sekhar Patra, “Bi Linear search a new session
of searching”, IJARCSSE, Vol. 4, Issue 3, pp. 459-463,
March 2014.
[6]. Phisan Kaewprapha,Thaewa TansarnandNattakan
Puttarak,”Network localization using tree search
algorithm”IEEE 2016.
[7]. Sankar Peddapati and K.K. Phanisri Kruthiventi,”A New
Random Search Algorithm: Multiple Solution Vector
Approach”, 2016 6th International Advanced Computing
Conference,pp.187-190, IEEE 2016.
[8]. Laith Muhammad Abualigah, Ahamad Tajudin
Khaderand Mohammed Azmi AI-Betar ,“Unsupervised
feature selection technique based on harmony search”,
2016 7th International Conference on Computer Science
and Information Technology (CSIT),IEEE 2016.
[9]. Archana Tiwari and Manjaree Pandit ,”Bid based
economic dispatch using symbiotic organisms search
algorithm”, 2nd IEEE International Conference on
Engineering and Technology (ICETECH), 17th&
18thMarch 2016, Coimbatore, TN, India,IEEE 2016.
[10]. Kashale Chimmanga, Josephat Kalezhi and Phillimon
Mumba,“Application of best first search algorithm to
948
View publication stats
demand control”,2016 IEEE PES Power Africa
Conference,pp. 51-55,IEEE 2016.
[11]. Thae Thae Yu Khine,Koji Araki, Daisuke Mitsunaga and
Hua-An Zhao” A nearest neighbor search algorithm for
LR-LD on high SNR” IEEE 2016.
[12]. en.wikipedia.org/wiki/Jump search
[13]. www.cs.utexas.edu/users/moore/publications/fstrpos.pdf
[14]. ieeexplore.ieee.org/Xplore/home.jsp
[15]. ieeexplore.ieee.org/document/7571840/
[16]. en.wikipedia.org/wiki/Interpolation search_algorithm
[17]. www.studytonight.com/data-structures/search-algorithms
[18]. www.cs.auckland.ac.nz/~jmor159/PLDS210/niemann/s_
man.pdf
[19]. www.researchgate.net/publication/262227023_Symbiotic
_Organisms_S
earch_A_new_metaheuristic_optimization_algorithm
[20]. en.wikipedia.org/wiki/Best-first_search
[21]. en.wikipedia.org/wiki/Harmony_search
[22]. www.iaeng.org/publication/WCECS2010/WCECS2010_
pp460-465.pdf
[23]. en.wikipedia.org/wiki/tree search