Searching Algorithms

Examples: Maze-solving, or that 4x4 game. Searching algorithms help figure out the correct sequence of actions to do something.

Simple Search through Array

Linear Search and Binary Search

Algorithm	Best Case(Ω)	Average Case(Θ)	Worst Case(O)
Linear Search	$O(1)$	$O(n)$	$O(n)$
Binary Search	$O(1)$	$O(\log n)$	$O(\log n)$

AI stuff (learned in CS50)

• AI Search
• Adversarial Search
• Best-First Search
• Minimax
• Alpha-Beta Pruning

Uniformed Search Algorithms

• Breadth-First Search
• Depth-First Search

Trees and Trees and Graphs are two super useful data structures to make search more easy.

Tree Search

Graph Search

Informed Search Algorithms

An informed search algorithm considers additional knowledge to try to improve its performance is called.

• Heurisitic Function
• Greedy Best-First Search
• Dijkstra’s Algorithm
• A-Star Algorithm

Other

• Backtracking