search algorithms


  • alpha beta pruning

    Alphabeta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games ( ...

  • binary search

    In computer science, a binary search or half-interval search algorithm finds the position of a target value within a sorted array. The binary search algorithm can be classified as a dichotomic divide and conquer search algorithm and executes in ...

  • binary search tree

    In computer science, binary search trees ( BST ), sometimes called ordered or sorted binary trees, are particular types of containers : data structures that store items (such as numbers, names, etc.) in memory. They allow fast lookup, addition and ...

  • boyer moore horspool

    In computer science, the BoyerMooreHorspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980. It is a simplification of the BoyerMoore string search algorithm which is ...