Heuristics in computer science

What does heuristics mean ?

First here the generic definitions :

A heuristic technique is any approach to problem solving that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is sufficient for reaching an immediate, short-term goal.
Heuristics can be mental shortcuts that ease the cognitive load of making a decision.

So heuristics is a mean to find the a solution to a problem by using the minimum of ressource.

People use it daily for making small choice “what to eat for breakfast”, “how to dress”.

In computer science, Heuristics define a technique that will allow us to find a solution or an approximation of a solution but in a less optimization way.

That could mean we put less important in the number of step or if the solution is the more correct one.

To summarize Heuristics is a shortcut for finding a solution.