A presentation is Linear Search Algorithms in Object Oriented Programming and Data Structure(C++).

1. Course Seminar on
“Linear Search Algorithm”
Presented By :-
Name : Ashish Anil Sadavarti
Course Name :- Object Oriented Programming & Data Structures
(PCCET304T)
Course In-charge :- Vivek Deshmukh Sir

2. Contents
 Definitions (Search & Linear Search)
 Example
 Pseudo Code
 Advantages & Disadvantages

3.  What is search?
Search is the process of looking for something.
 What is linear search?
linear search or sequential search is a method for
finding a target value within a list. It sequentially
checks each element of the list for the target value
until a match is found or until all the elements have
been searched.
Definitions Linear Search

4. Linear Search Example
 If you are asked to find the name of the
person having phone number say "1234
with the help of a telephone directory.
 Since telephone directory is sorted by
name not by numbers, we have to go
through each and every number of the
directory

5.  For all elements
Check if it is equal to element being searched for.
If it is, return its position.
Else continue.
Pseudo Code

6. Linear Search Advantages & Disadvantages
● Advantages ●
If the first number in the directory is the
number you were searching for ,then
lucky you!.
Since you have found it on the very first
page. Now its not important for you that
how many pages are there in the
directory.
● Disadvantages ●
It may happen that the number you are
searching for is the last number of
directory or if it is not in the directory at
all.
In that case you have to search the
whole directory.

7. THANK YOU