Scribd
Upload
11 views

Searching Algorithms

Breath First Search (BFS) is a graph traversal algorithm that explores all neighboring nodes of the starting node before moving to the next level neighbors. It uses a queue to keep track of visited and non-visited vertices. BFS selects a starting node, visits its neighbors, and then their neighbors until the whole graph is explored.

Uploaded by

Hamza khalid
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views

Searching Algorithms

Breath First Search (BFS) is a graph traversal algorithm that explores all neighboring nodes of the starting node before moving to the next level neighbors. It uses a queue to keep track of visited and non-visited vertices. BFS selects a starting node, visits its neighbors, and then their neighbors until the whole graph is explored.

Uploaded by

Hamza khalid
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 31

Breath First Search

Breath First Search


There are many ways to traverse the graph, but among them, BFS is the
most commonly used approach. It is a recursive algorithm to search all
the vertices of a tree or graph data structure. BFS puts every vertex of
the graph into two categories - visited and non-visited. It selects a single
node in a graph and, after that, visits all the nodes adjacent to the
selected node.
Breath First Search

BFS= ABCDEFGHIJKLLMN
OUT PUT:
Depth First Search
DFS (Depth-first search) is a technique used for traversing
trees or graphs. Here backtracking is used for traversal. In this
traversal first, the deepest node is visited and then backtracks
to its parent node if no sibling of that node exists
Linear Search
Linear search is a search algorithm where 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 until
the end of the data collection.
How Does Linear Search Algorithm Work?

In Linear Search Algorithm,


• Every element is considered as a potential match for the key and
checked for the same.
• If any element is found equal to the key, the search is successful and
the index of that element is returned.
• If no element is found equal to the key, the search yields “No match
found”.
Example
Consider the array arr[] = {10, 50, 30, 70, 80, 20, 90, 40} and
key = 30
Step 1: Start from the first element (index 0) and compare key with each element
(arr[i]).
Comparing key with first element arr[0]. SInce not equal, the iterator moves to
the next element as a potential match.
Example Continue…
Comparing key with next element arr[1]. SInce not equal, the iterator
moves to the next element as a potential match.
Example Continue…
Step 2: Now when comparing arr[2] with key, the value matches. So the
Linear Search Algorithm will yield a successful message and return the
index of the element when key is found (here 2).
Complexity Analysis of linear Search
Time Complexity:
• Best Case: In the best case, the key might be present at the first index.
So the best case complexity is O(1)
• Worst Case: In the worst case, the key might be present at the last
index i.e., opposite to the end from which the search has started in the
list. So the worst-case complexity is O(N) where N is the size of the
list.
• Average Case: O(N)
Binary search
Binary Search is defined as a searching algorithm used in a sorted
array by repeatedly dividing the search interval in half. The idea of
binary search is to use the information that the array is sorted and
reduce the time complexity to O(log N).
Conditions for when to apply Binary Search in a Data
Structure:
• To apply Binary Search algorithm:
• The data structure must be sorted.
• Access to any element of the data structure takes constant time.
How does Binary Search work?

• In this algorithm,
• Divide the search space into two halves by finding the middle index
“mid”
• Compare the middle element of the search space with the key.
• If the key is found at middle element, the process is terminated.
• If the key is not found at middle element, choose which half will be
used as the next search space.
• If the key is smaller than the middle element, then the left side is used for next
search.
• If the key is larger than the middle element, then the right side is used for next
search.
• This process is continued until the key is found or the total search
space is exhausted.
Example
• Consider an array arr[] = {2, 5, 8, 12, 16, 23, 38, 56, 72, 91}, and the target =
23.
• First Step: Calculate the mid and compare the mid element with the key. If the
key is less than mid element, move to left and if it is greater than the mid then
move search space to the right.
• Key (i.e., 23) is greater than current mid element (i.e., 16). The search space
moves to the right.
Key 23 is less than the current mid 56. The search space moves to the
left.
Second Step: If the key matches the value of the mid element, the
element is found and stop search.
Complexity Analysis of Binary Search:
• Time Complexity:
• Best Case: O(1)
• Average Case: O(log N)
• Worst Case: O(log N)
Class Activity
21 34 43 57 66 78 search 78

Search 9

You might also like