Explore Algorithm on MathWorld

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point.

Algorithm is a college-level concept that would be first encountered in a discrete mathematics course.


Euclidean Algorithm: The Euclidean algorithm is an algorithm for finding the greatest common divisor of two numbers.
Newton's Method: Newton's method is an iterative method for numerically finding a root of a function.
Prime Factorization Algorithms: Prime factorization algorithms are algorithms that have been devised for determining the prime factors of a given number (a process called prime factorization).

Classroom Articles on Discrete Mathematics (Up to College Level)

  • Binary
  • Graph
  • Binomial Coefficient
  • Graph Cycle
  • Binomial Theorem
  • Graph Theory
  • Chromatic Number
  • Logic
  • Combinatorics
  • Magic Square
  • Complete Graph
  • Pascal's Triangle
  • Connected Graph
  • Permutation
  • Cycle Graph
  • Planar Graph
  • Directed Graph
  • Polyhedral Graph
  • Discrete Mathematics
  • Recurrence Relation
  • Fibonacci Number
  • Tree
  • Generating Function