Searching Algorithms

https://en.wikipedia.org/wiki/Selection_algorithm

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

Selection can be done with heaps in time $\Theta (n+k\log n)$. Median-finding with this takes time $\Theta (n\log n)$.

Simple Search Through Array

Linear Search and Binary Search

Uniformed Search Algorithms

• Breadth-First Search
• Depth-First Search

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

Tree Search

Graph Search

Informed Search Algorithms

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

• Heuristic Function
• Greedy Best-First Search
• Dijkstra’s Algorithm

Other:

• Backtracking