In computer science, a heuristic is a problem-solving approach that employs practical methods or rules of thumb to find satisfactory solutions, especially when classic methods may be inefficient or unfeasible. Heuristics can significantly reduce the time and resources needed to reach a solution, especially in complex situations. They are commonly used in algorithms for tasks such as searching, optimization, and decision-making. Although heuristics do not guarantee optimal results, they are valuable for quickly addressing real-world problems.