Greedy Algorithm: An iterative method that builds a solution by consistently selecting the locally optimal choice, often used in submodular optimisation due to its efficiency and simplicity.