Search algorithms: Linear Search, Binary Search, Depth First Search and Breadth First Search

An explanation of different traversing or search algorithms: linear search, binary search, depth first search (dfs) and breadth first search (bfs). Preparing for a tech interview? On this video I talk about Traversing or Search Algorithms in general and provide a detailed explanation on how Linear Search, Binary Search, Depth First Search (DFS) and Breadth First Search (BFS) algorithms work. These are typical and important algorithms in Computer Science and commonly asked during technical/coding interviews. This video is very focused and you will get the explanation in a nutshell. Linear search can be applied to linear data structures. Binary search can be applied to linear or non-linear data structures. BFS and DFS are commonly used in tree and graph traversal.  If you are in a hurry and want to get a grasp of basic CS Fundamentals quickly, specially to review topics for technical interviews, I think this video might be useful to yo