Skip to main content

Algorithms

Algorithms are step-by-step methods for solving problems.

What Are Algorithms​

Algorithms describe how to search, sort, transform, validate, calculate, or decide something.

Good algorithms are correct, understandable, and efficient for the expected input size.

How To Use Algorithms​

Understand the input, output, constraints, and edge cases. Then choose a strategy and measure its complexity.

Basic Example​

function findLargest(numbers) {
  let largest = numbers[0];

  for (const number of numbers) {
    if (number > largest) {
      largest = number;
    }
  }

  return largest;
}

Common Concepts​

  • Big O describes growth.
  • Sorting organizes values.
  • Searching finds values.
  • Recursion solves problems through smaller subproblems.

What To Learn Next​

Learn binary search, sorting, recursion, dynamic programming, greedy algorithms, graph algorithms, and complexity analysis.