-
Notifications
You must be signed in to change notification settings - Fork 0
Algo: Searching
Rishav Ray edited this page May 17, 2025
·
1 revision
-
A searching algorithm is a one that deals with finding an item in a list.
-
There are 5 significant search algorithms: Linear, Binary, Ternary, Breadth-First, & Depth-First.
- Linear search is an algorithm where the list is traversed from the start until the element is found.
- Binary search is an algorithm used in sorted lists. It involves splitting the list into halves until the element is found.
- Ternary search is an algorithm used in sorted lists. It involves splitting the list into thirds until the element is found.
- Breadth-First search is an algorithm used in graphs where nodes are traversed one level at a time.
- Depth-First search is a recursive algorithm used in graphs where nodes are traversed based on their descendancy of one of their ancestor nodes.