Brute force is a straighforward approach to solving a problem, usually directly based on the problem statement and definitions of the concepts involved.

Greedy method constucts a solution one step at a time by making a choice that is feasible, locally optimal and irrevocable. Below are some alorithms solved using Greedy technique.

Decrease and Conquer technique is a way of solving a problem by changing the instance into a smaller instance, solving the smaller instance to get a solution for bigger instance.

Divide and Conquer technique is a way of solving a problem by dividing a bigger problem into smaller problems and recursively solving them to get a solution for bigger instance.