Lukas' Notes

Home

❯

Knowledge

❯

Algorithm

Oct 27, 20251 min read

computation

Definition

Algorithm

An algorithm for a problem $P$ is a well-defined description of computational steps that allows us to solve an arbitrary instance of $P$ .

Greedy

Definition

Greedy Algorithm

An algorithm is called greedy if it constructs a solution incrementally using a local criterion, without foresight, to select the next solution component to be added.

Link to original

Graph View

Definition
Greedy

Backlinks

Approximation Algorithm
Big O Notation
Clustering Algorithm
Computable Function
Computable Partial Function
Computable Total Function
Constraint Satisfaction Problem
Decidable Decision Problem
Dual Heuristic
Gale–Shapley Algorithm
Greedy Algorithm
Halting Problem
Hierholzer's Algorithm
In-Place Algorithm
Intractable Problem
Meta Heuristic
Polynomial Time Reduction
Problem Instance
Problem
Risk
Runtime
Space Complexity
Tractable Problem
Turing Reduction
Upper Confidence Bound
An Algorithm for Optimal Lambda Calculus Reduction
Large-Scale Gaussian Processes via Alternating Projection

GitHub

Lukas' Notes

Algorithm

Definition

Greedy

Definition

Graph View

Table of Contents

Backlinks