A set of instructions or rules that are clearly defined and offer a solution to a specific problem or task is known as an algorithm. With roots tracing back to ancient civilizations, algorithms have undergone centuries of evolution and today play a pivotal role in contemporary computing. Techniques such as divide-and-conquer are utilized in their creation and their efficiency is assessed via metrics such as big O notation. Algorithms can be depicted in multiple ways, including pseudocode, flowcharts, or programming languages. To execute them, they are translated into a language comprehensible to computers, with the execution speed being influenced by the utilized instruction set. Depending on their design or implementation paradigm, algorithms can be categorized differently, and their level of efficiency can greatly affect processing time. In fields like computer science and artificial intelligence, the comprehension and effective application of algorithms is vital.
In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ⓘ) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually. Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus".
In contrast, a heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. For example, social media recommender systems rely on heuristics in such a way that, although widely characterized as "algorithms" in 21st century popular media, cannot deliver correct results due to the nature of the problem.
As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
English 
Español 
Français