Curiosity first
How do computers follow a plan?
An algorithm is a step-by-step set of instructions. It helps a computer solve a problem in a clear and repeatable way.
Let’s explain it simply.
What you will learn on this page
- What an algorithm is: a defined sequence or method that transforms input into a result for a stated goal.
- How it solves a problem: it removes repeated guessing by expressing decisions and steps that can be followed consistently.
- Where you encounter one: search ranking, routes, recommendations, fraud checks, sorting and many everyday calculations.
- Why order and priorities matter: changing a step or the goal can produce a different answer from the same input.
The recipe example
A recipe is an algorithm. It tells you the steps to follow in order. If you skip steps or mix them up, the result may not be right.
Algorithms in software
Software uses algorithms to search, sort, recommend, calculate, detect fraud, plan routes and answer questions.
Why algorithms matter
Good algorithms help software work faster and smarter. A bad algorithm may still work, but it can be slow, confusing or inaccurate.
Where you will see this in real life
Google
A search engine does not simply find pages containing a word. Ranking methods consider relevance, authority, freshness, language and location, then order enormous numbers of candidates. The exact formula changes because low-quality publishers also try to manipulate it.
Google
Map software compares possible routes using distance, road speed, traffic, closures and allowed turns. “Shortest” and “fastest” are different goals, so changing the priority can produce a different but still correct route.
Netflix
A streaming recommendation method compares viewing history, similar audiences and information about each programme. It predicts what may hold attention; it does not understand personal taste perfectly, which is why feedback and diversity controls matter.
Bank
A bank may score a payment using amount, location, device, merchant and recent activity. A high score can trigger verification instead of automatic rejection. The institution must balance fraud prevention against blocking legitimate customers.
An algorithm should be judged against its goal
Ordered steps are useful only when the input, priority and desired outcome are clear. Correctness, speed, fairness and explainability can compete, so designers must decide which trade-offs are acceptable for the people affected.
A repeatable set of decisions
An algorithm is a method, not magic
An algorithm is a defined method for turning inputs into an output. It can be as simple as sorting names alphabetically or as complex as finding a route through a road network. The important qualities are that the steps are clear enough to follow and that they eventually produce the required result for the situations the algorithm is designed to handle.
See it in real life
A booking site that needs to show the cheapest available unit can gather valid options, remove units that do not meet the dates or occupancy, calculate the full price for each remaining option and sort the results. That process is an algorithm even if the code uses database queries and library functions to perform individual steps.
Why this matters
Different algorithms can solve the same problem with very different costs. When data becomes large, a method that repeatedly scans everything may become slow while a better data structure or search strategy remains fast. This is why developers study both correctness and efficiency.
A common misunderstanding
The word algorithm is often used as if it means a mysterious social-media system. Recommendation algorithms are one application, but recipes, route planning, spell checking and database sorting also use algorithms. The concept itself is neutral; the consequences depend on the goal, data and decisions built around it.
Questions people actually ask
Useful questions about this topic
Is an algorithm the same as code?
No. An algorithm is the method or logical procedure. Code is one way of implementing that method in a programming language.
What makes an algorithm efficient?
Efficiency considers how time and memory grow as the input becomes larger. A method that is fine for ten records may be unsuitable for millions.
Can two algorithms give the same answer?
Yes. Many problems have several correct approaches. Developers choose between them based on simplicity, performance, memory, reliability and constraints.
Do algorithms make decisions by themselves?
They follow the rules and data they are given. Human choices determine the objective, available inputs and what counts as an acceptable result.
An algorithm is useful because it turns a goal into repeatable steps
A recipe is a common analogy, but software algorithms also have to handle choices and unexpected situations. A route-planning algorithm does not follow one fixed list of roads; it compares possible routes using information such as distance, traffic and road restrictions.
The quality of an algorithm depends on more than whether it eventually produces an answer. Developers also care about how long it takes, how much memory it uses and whether it still works when the amount of data becomes very large.
Two algorithms can therefore solve the same problem but behave very differently in practice. Choosing the right one is part of designing software that remains fast and reliable as usage grows.
Follow the connectionMove from ordered steps to the data and code that execute them
Programming expresses an algorithm in a form a computer can run, while SQL supplies and reshapes the structured data many algorithms need. For systems that rank or generate rather than follow one fixed answer, read how developers use and verify AI-assisted output.
Frequently Asked Questions
Questions about What Is an Algorithm?
Is an algorithm always complicated?
No. Some algorithms are very simple, like checking if a number is bigger than another.
Do AI systems use algorithms?
Yes. AI uses many algorithms to learn patterns, make predictions and generate responses.
A real decision processAn algorithm is useful because the steps remove guessing
Imagine a website needs to show the cheapest available room. “Find a cheap room” is too vague for a computer. The instruction has to become a repeatable process: load rooms for the selected dates, remove rooms that are unavailable, compare the remaining prices, sort from lowest to highest, and return the first result. That sequence is an algorithm.
Two algorithms can produce the same answer but take very different amounts of work. If a system has ten records, almost any sensible approach feels fast. If it has ten million records, the way the search or sort is designed becomes important. Computer science studies this efficiency so developers can predict how an approach behaves as the amount of data grows.
Algorithms are not the same as AI
An ordinary algorithm follows rules chosen by people. A tax calculation, password-length check or alphabetical sort can be completely deterministic: give it the same input and it follows the same steps to the same result. Machine-learning systems are different because part of their behaviour comes from patterns learned from training data. They still use algorithms, but “algorithm” does not automatically mean “artificial intelligence.”
Good algorithms also account for awkward inputs. What happens if there are no available rooms? What if two prices are equal? What if the date is invalid? Handling those cases is part of designing the process, not an afterthought.
Real-World DepthAn Algorithm Is A Procedure With A Goal
A recipe is a useful analogy because it has ordered steps, but software algorithms also need precise inputs, outputs and rules for unusual cases. A sorting algorithm receives items and produces them in an order. A route-finding algorithm receives a map and endpoints and produces a path according to some objective such as shortest distance or fastest time.
Different algorithms can solve the same problem with very different costs. Looking through one million records one by one may work, but a suitable index or search structure can reduce the work dramatically. At small scale the difference is invisible; at large scale it determines whether a system feels instant or unusable.
Algorithms also encode priorities. A recommendation algorithm optimised only for clicks may choose different content from one designed for learning quality or user wellbeing. The technical procedure cannot be separated completely from the goal humans chose for it.