2 min. read

Algorithms are templates or general guides to solving problems in Computer Science and programming.

Binary Search Algorithm

Common Algorithms:
Compression algorithms
Route finding algorithms
Rendering Algorithm
Optimization and Scheduling Algorithm
Minimax algorithms

What makes a good algorithm?
Correctness and Efficiency

Asymptotic Analysis

Search Algorithms:
linear search - Search from the start, each item
binary search - Halving each attempt

Alpha–beta pruning

Alpha = best already explored option along path to the root for maximizer
Beta = best already explored option along path to the root for maminimzer

At start
Alpha = - Infinite
Beta = + Infinite

Zero-sum game

Also called strictly strictly competitive

Zero-sum games are most often solved with the minimax theorem which is closely related to linear programming duality, or with Nash equilibrium.

any game where all strategies are Pareto optimal is called a conflict game


Zero-sum Game

Minimax theorem

Game Theory

Pareto Efficiency

Solution Concept

Nash equilibrium

Mixed Strategy

Fair cake-cutting

Linear Programming


Analysis of Algorithm

Sliding Windows



Khan Academy:

Binary Search Algorithm in 100 Seconds