You can follow steps to solve a task. It is like a recipe for food. These steps help you get an answer. They can be used by people or machines. Do you like to follow rules?
An algorithm is a set of rules. It is like a list of steps. These steps help you solve a problem. You can use them to find an answer.
People have used these steps for a long time. Ancient people in Babylon used them. They used them to study the stars.
Some steps are used by machines. A computer can follow these rules. One woman named Ada Lovelace wrote steps for a machine. She is called the first programmer.
Today, apps use these rules too. They help show you things you like. They make the apps work well.
An algorithm is a set of rules. These rules are a sequence of steps. They help solve a specific problem.
An algorithm must have a start and an end. It takes inputs to work. Then it gives an output. This output is the answer. Some algorithms use random input. These are called randomized algorithms.
People have used these steps for a long time. Ancient Babylonians used them for math. They also used them to study stars. In the 9th century, Al-Kindi used them to break codes.
Machines can follow these rules too. Ada Lovelace wrote the first algorithm for a computer. She is known as the first programmer.
Today, we use them every day. Social media apps use them to show you things you like. Some new tools use quantum computing to work even faster.
An algorithm is a specific set of rules to solve a problem. These rules are a sequence of steps that a person or machine follows. Every algorithm needs a starting point and some initial inputs. These inputs are the pieces of information given to the algorithm at the beginning. As the steps are followed, the algorithm moves through different states. Finally, it produces an output, which is the result or answer. A true algorithm must eventually stop after a finite number of steps.
Algorithms work by following instructions very carefully. Some instructions allow for different paths to be taken. This is called automated decision-making. Advanced algorithms can even use automated reasoning to make logical guesses. Most algorithms are deterministic, meaning they follow the same path every time. However, some are called randomized algorithms because they use random input. This is different from a heuristic, which is a way to solve problems without a perfect answer. Social media apps often use heuristics to suggest videos you might like.
People have used step-by-step procedures for thousands of years. The earliest evidence comes from ancient Mesopotamian mathematics. Sumerian clay tablets from near Baghdad show early division algorithms. Babylonian mathematicians also used these steps for astronomy to track stars. Ancient Egyptians used them in the Rhind Mathematical Papyrus. In the 9th century, the Arab mathematician Al-Kindi created a codebreaking algorithm. He used frequency analysis to help decipher secret messages.
The word "algorithm" has a very interesting history. It comes from the name of a Persian scientist named Al-Khwarizmi. He lived around 825 AD and wrote books on Indian computation. In the 12th century, Latin translations of his work appeared in Europe. The name was Latinized into "algorismi." By the 15th century, the word changed to "algorithmus" due to Greek influence. Eventually, the English word "algorithm" became the standard term we use today.
Today, algorithms are part of almost everything we do. They help run the apps on our phones and computers. Scientists are even using quantum algorithms to solve problems much faster. We can show algorithms using many different tools. Some people use flowcharts to draw the steps visually. Others use programming languages so a computer can read them. You might also see them written in pseudocode or simple English. These different methods help us understand how the rules work.
An algorithm is a finite sequence of mathematically rigorous instructions. These instructions are designed to solve a specific class of problems or to perform a computation. To function, an algorithm requires an initial state and initial input. These inputs are the quantities provided to the process before it begins. As the instructions are executed, the algorithm moves through a series of well-defined successive states. Eventually, it produces an output, which is a quantity that has a specified relation to the inputs. A critical requirement is that an algorithm must terminate in a finite number of steps. If a procedure lacks this finiteness, it is instead called a computational method.
Algorithms operate through structured logic and can vary in their complexity. Most algorithms are deterministic, meaning they follow a predictable path. However, some are known as randomized algorithms because they incorporate random input. Advanced algorithms can also use conditionals to divert execution through different routes. This process is known as automated decision-making. Some systems even use automated reasoning to deduce valid inferences. It is important to distinguish algorithms from heuristics. A heuristic is an approach used to solve problems without guaranteeing a correct or optimal result. For example, social media recommender systems often rely on heuristics rather than true algorithms because there is no single correct recommendation.
Humanity has used step-by-step procedures for millennia. The earliest evidence of algorithms is found in ancient Mesopotamian mathematics. A Sumerian clay tablet from Shuruppak describes an early division algorithm. During the Hammurabi dynasty, Babylonian clay tablets used algorithms for computing formulas and for astronomy. These procedures helped track significant astronomical events. Ancient Egyptian mathematics also included algorithms, such as those found in the Rhind Mathematical Papyrus. Other ancient traditions include Greek mathematics, Indian mathematics, and Chinese mathematics. In the 9th century, the Arab mathematician Al-Kindi developed the first cryptographic algorithm. He used frequency analysis to perform cryptanalysis, which is the process of codebreaking.
The word "algorithm" has a deep etymological history. It is derived from the name of the Persian polymath Muḥammad ibn Mūsā al-Khwārizmī. Around 825 AD, he wrote books on Indian computation and arithmetic. In the early 12th century, Latin translations of his work appeared in Europe. These texts included terms like "algorismi," which was a Latinization of his name. In the 15th century, the word was altered to "algorithmus" due to the influence of the Greek word "arithmos," meaning number. By 1596, the English form "algorithm" was used by Thomas Hood. Previously, the English word "algorism" referred specifically to the use of place-value notation in calculations.
Technological progress has transformed how algorithms are executed. The invention of the weight-driven clock in Europe led to mechanical automata. In the mid-19th century, Charles Babbage and Ada Lovelace worked on the difference and analytical engines. Lovelace designed the first algorithm intended for processing on a computer. Because of this, she is often called history's first programmer. Later, the development of electromechanical relays and telephone-switching technologies aided computer growth. In 1937, George Stibitz constructed a binary adding device while working at Bell Laboratories. This was a significant step away from the burdensome use of mechanical gear-based calculators.
In the 20th century, mathematicians began to formalize the concept of the algorithm. In 1928, attempts were made to solve the Entscheidungsproblem, or decision problem, posed by David Hilbert. This led to definitions of "effective calculability" or "effective methods." Significant formalizations included the recursive functions of Gödel, Herbrand, and Kleene. Other vital contributions came from Alonzo Church's lambda calculus and Alan Turing's Turing machines. Turing machines provide a way to represent algorithms through machine tables, flowcharts, or assembly code. These descriptions can be high-level, implementation-based, or highly detailed formal descriptions.
Today, algorithms are essential to modern digital life and scientific advancement. They power social media apps like Instagram and YouTube by analyzing user interaction. In the field of computing, quantum algorithms are used to solve problems with much higher speeds. This is especially relevant to security, as NIST updated post-quantum encryption standards in 2024. These new algorithms are designed to enhance defenses against potential attacks from quantum computing. Algorithms can be expressed in many ways, including natural language, pseudocode, or programming languages. While natural language is often too ambiguous for technical work, programming languages allow computers to execute these complex instructions directly.
Where will your curiosity go next?
🖼️ Images & Media (2)
More to explore
✨ What else?
Related topics you might enjoy
🔬 Go deeper
More advanced topics to explore
🪜 Step back
Simpler topics to build understanding
What is Nepedia?
A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.