What an Algorithm Actually Is

The plain-language idea

If the word "algorithm" makes you a little uneasy, you're not alone. Most people hear it and picture a chalkboard full of equations. That picture is wrong, and it's the reason a lot of people feel behind before they've even started. This whole track exists to fix that picture, one small piece at a time.

Here's the real definition: an algorithm is a set of steps for getting something done, written down in order. That's it. A recipe is an algorithm. "Preheat the oven, mix the dry ingredients, add the wet ones, bake for 25 minutes" — four steps, done in order, that reliably get you a cake. You've been following algorithms your whole life without ever calling them that.

Directions are an algorithm too. "Turn left at the gas station, go two miles, turn right after the church" gets a stranger to your house every time, as long as they follow the steps in order. Nothing about that requires math. It requires being specific and being in order.

In programming, an algorithm is the same idea, just aimed at a computer instead of a person: a precise, ordered list of steps for solving one specific problem — finding the biggest number in a list, checking if a password is correct, putting names in alphabetical order. Code is one way of writing an algorithm down. It's not the only way, and it's not the hard part. The hard part — and the part this track will build up slowly — is figuring out the steps in the first place.

See it in a real thing: finding the biggest number

// The task: find the biggest number in a list.
// The "recipe," in plain English, before any code:
//   1. Guess that the first number is the biggest.
//   2. Look at each remaining number, one at a time.
//   3. If one is bigger than our current guess, update the guess.
//   4. When we've checked every number, our guess is the answer.

function findBiggest(numbers) {
  let biggest = numbers[0]; // start with a guess: the first number

  for (let i = 1; i < numbers.length; i++) {
    if (numbers[i] > biggest) {
      biggest = numbers[i]; // a bigger number showed up, update the guess
    }
  }

  return biggest; // whatever survived all the comparisons
}

console.log(findBiggest([3, 7, 2, 9, 4])); // 9

Every line in that function maps to a step in the plain-English recipe above it. That mapping — plain words first, code second — is a habit worth keeping for the rest of this track.

What people usually miss

Watch out

• "Algorithm" sounds like it means heavy math. It doesn't. An algorithm is just ordered steps. Sorting your laundry into piles is an algorithm. The math shows up later, and only sometimes, when we start measuring how fast an algorithm is.
• They think code and algorithm are the same thing. Code is one way to write an algorithm down. You could also describe the same algorithm in plain English, on a whiteboard, or as a numbered list — like this lesson just did.
• They think you either "know" an algorithm or you don't. Algorithms aren't facts to memorize. They're built, step by step, by breaking a problem down until each piece is small enough to describe clearly. That skill gets easier with practice, not with memorization.

The genealogy: where this leads

Every lesson after this one is really asking one extra question about algorithms: not just "does it work?" but "how much work does it take, and does that change as the input grows?" That question is called Big O, and it's next.