Term | Definition |
---|---|
Algorithm | Unambiguous sequence of steps for solving a problem |
Recurrence Relation | Equation which describes a function in terms of its outputs on small inputs |
Greedy algorithm | Repeatedly tries to maximise the return by examining local conditions and hoping that each return moves closer to the desired final result |
Divide & Conquer | Solve problem by combining solutions of smaller subproblems |
Decrease & Conquer | Solve problem by solving smaller instances of that same problem. |
Space Time | Solve problem faster by using more space (or vice versa, is space is the problem) |
Problem Reduction | Solve problem A by transforming it to an instance of another problem B |
Dynamic Programming | Solve problem by combining solutions of overlapping smaller subproblems |