Skip to content
Main menu
  • Main page
  • Discover
  • Unexpected connections
  • Topics
  • Random article
  • Search
Your library
  • Saved articles
  • Recent discoveries
  • Rabbit-hole trails
Topic areas
  • Computer Science
  • Mathematics
  • Physics
  • Engineering
  • Biology
  • Economics
  • Curiosities
WikiholeDeeper into Wikipedia
EnglishEN
  • Saved
  • History

  • Article text and media come live from Wikipedia via the official MediaWiki API and are available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply. Each article links to its source and revision.
  • WikiHole is an independent project and is not affiliated with the Wikimedia Foundation.
  • How ranking works
  • All topics
  • Reading history
  • Random article
  • MediaWiki API

Algorithm

  • Article
  • Rabbit hole
  • Read
  • View history
Tools
Actions
  • Read
  • View history
General
  • Recent changes
  • Related articles
  • Random discovery
This article
Reading time
25 min
Topic
Computer Science
Quality
C-class
Views
12k in 14 days
Last edited
8 Nov 2026
Print/export
  • Printable version
In other projects
  • Wikidata item
From Wikipedia, the free encyclopedia
Rabbit hole:
  1. Algorithm
Algorithm
Sequence of operations for a task

In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.1 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 with terms such as "memory", "search" and "stimulus".

Last edited
8 Nov 2026
Alan Turing
2

"Algorithms" redirects here. For the subfield of computer science, see Analysis of algorithms. For other uses, see Algorithm (disambiguation).

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.3 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 time4 and in a well-defined formal language5 for calculating a function.6 Starting from an initial state and initial input (perhaps empty),7 the instructions describe a computation that, when executed, proceeds through a finite8 number of well-defined successive states, eventually producing "output"9 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.10

Loading the rest of the article…

Recent changes

Rabbit hole

Where Algorithm leads. Every connection below has a source: a link in this article, a shared Wikipedia category, or CirrusSearch text similarity. Articles already on your trail are left out.

General
  • Recent changes
  • Related articles
  • Random discovery
This article
Reading time
25 min
Topic
Computer Science
Quality
C-class
Views
12k in 14 days
Last edited
8 Nov 2026
Print/export
  • Printable version
In other projects
  • Wikidata item

Wikipedia did not return the list of recent edits.

View full revision history

Last edited
8 Nov 2026

The rest of this article could not be loaded.

Wikipedia is rate limiting us right now. Try again in a minute.
Try again

Related articles are unavailable right now.

Wikipedia is rate limiting us right now. Try again in a minute.