the A* algorithm does: BFS with heuristic f(n) = g(n) + h(n)

BFS vs DFS: BFS finds shortest path in unweighted graphs, DFS uses less memory

BFS finds shortest path in unweighted graphs; DFS uses less memory

Binary search

Time complexity of binary search: O(log n) — halves search space each step

Dijkstra's algorithm

Dijkstra's algorithm time complexity: O((V+E) log V)

Graph (abstract data type)

Time complexity of BFS and DFS: O(V + E)

Shor's algorithm

Shor's algorithm factors integers in polynomial time on a quantum computer

Bayes' theorem

Bayes' theorem formula: P(A|B) = [P(B|A) * P(A)] / P(B)