BCSE202L- Data Structures
and Algorithms
Dr. Iyappan Perumal
Associate Professor
School of Computer Science & Engineering
VIT, Vellore.
BCSE202L- Data Structures and
Algorithms
Text Books:
1. Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 4 th
Edition, 2013,Pearson Education.
Reference Books:
1. Alfred V. Aho, Jeffrey D. Ullman and John E. Hopcroft, Data
Structures and Algorithms,1983, Pearson Education.
2. Horowitz, Sahni and S. Anderson-Freed, Fundamentals of Data
Structures in C, 2008, 2nd Edition, Universities Press.
3. Thomas H. Cormen, C.E. Leiserson, R L. Rivest and C. Stein,
Introduction to Algorithms, 2009, 3rd Edition, MIT Press.
Module 3: Searching & Sorting Algorithms
Searching Techniques
◦ Linear Search
◦ Binary Search
Sorting Problem
◦ Bubble Sort
◦ Insertion Sort
◦ Selection Sort
◦ Merge Sort
◦ Quick Sort
◦ Counting Sort
◦ Analysis of Sorting Algorithms
Implementation of Searching
Algorithm
Linear Search
◦ Linear search is a very simple search algorithm.
In this type of search, a sequential search is
made over all items one by one. Every item is
checked and if a match is found then that
particular item is returned, otherwise the search
continues till the end of the data collection.
Linear search( array[], search element)
{
for i=1 to n do
{
if( array[i]==search element)
{
return i;
}
}
return 0;
}
Binary Search
Binary search is a fast search algorithm
works on the principle of divide and
conquer,
Data should be compulsory in the sorted
form
How Binary Search Works?
Binary search looks for a particular item by
comparing the middle most item of the
collection. If a match occurs, then the index
of item is returned.
If the middle item is greater than the item,
then the item is searched in the sub-array
to the left of the middle item.
Otherwise, the item is searched for in the
sub-array to the right of the middle item.
This process continues on the sub-array as
well until the size of the subarray reduces
to zero.
Binary search( array[], x, Low, high, mid)
{
Low=1, high=n;
While(low<=high)
{
mid=(low+high)/2;// Finding mid value
if(x==a[mid])
return mid;
else if(x<a[mid])
high=mid-1;
else
low=mid+1;
}
return 0;
}
How Binary Search Works?
For a binary search to work, it is mandatory for the target array
to be sorted.
Example:
• The following is our sorted array and let us assume that we
need to search the location of value 31 using binary search.
Binary Search
First, we shall determine half of the array by using this
formula −
mid = (low + high) / 2
Here it is, (0 + 9)/ 2 = 4 (integer value of 4.5).
So, 4 is the mid of the array.
Binary Search
• Now we compare the value stored at location 4, with the
value being searched, i.e. 31.
• We find that the value at location 4 is 27, which is not a
match.
• As the value is greater than 27 and we have a sorted array,
so we also know that the target value must be in the upper
portion of the array.
Binary Search
We change our low to mid + 1 and find the new mid value again.
low = mid + 1
High = remains same
mid = (low + high) / 2
Low=4+1=5; mid=(5+9)/2=7
Our new mid is 7 now. We compare the value stored at location 7
with our target value 31.
• The value stored at location 7 is not a match, rather it is
more than what we are looking for. So, the value must be
in the lower part from this location.
• Hence, we calculate the mid again. This time it is 5.
Binary Search
• We compare the value stored at location 5 with our
target value. We find that it is a match.
• We conclude that the target value 31 is stored at
location 5.
• Binary search halves the searchable items and thus
reduces the count of comparisons to be made to very
less numbers.
Visualization of Linear and Binary
Search
https://www.cs.usfca.edu/~galles/visualizatio
n/Search.html
Performance analysis of an
Algorithm
Time Complexity
Space Complexity
