8 docs tagged with "Search"

Basic principles of the BFS algorithm and its implementation using Python

Write a function to find the smallest odd value using a Binary Search Tree

The basic principles of the DFS algorithm and how to implement it using Python

Principles and time complexity of binary search

Binary search is an efficient method for finding a specific value in a sorted array by repeatedly dividing the search interval in half.

BFS is an algorithm that explores nodes level by level from a starting node in a graph or tree.

DFS is an algorithm for traversing or searching tree or graph data structures, starting at the root node and exploring as far along each branch as possible.

Sequential search is a basic search algorithm that examines each element in an array or list sequentially to find the desired value.