Discover published sets by community

Linear search iterates over all elements in a list sequentially until the target is found or the list ends. Complexity: O(n)

Interpolation search calculates an estimated position of the target based on the values of boundaries and the target value, assuming a uniform distribution of values within the interval. Complexity: Average O(log(log n)), Worst O(n)

Binary search divides the search interval in half with each step, requiring the data to be sorted before searching. Complexity: O(log n)

DFS explores as far as possible along each branch before backtracking, typically implemented using recursion or a stack. Complexity: O(V + E) for graphs