If you want to learn how to code, you’ll want to learn how to write pseudocode. Writing pseudocode helps you think through the problem before writing any code. In this tutorial, you will learn how to write pseudocode while solving the classic Fizz Buzz algorithm.
💯 Give yourself an A. Grab your copy of A is for Algorithms
Retrieval Practice

What is programming?

What is plain language?

What is the modulo operator?
What is Programming?
Programming is problem solving. There are four steps we need to take to solve any programming problem:

Understand the problem

Make a plan

Execute the plan

Evaluate the plan
What is Plain Language?
Plain language is a simple and straightforward approach to writing that ensures the reader can quickly and easily understand what is being communicated.
Was this effective?
What is the Modulo Operator?
In programming, the modulo operation returns the remainder of a division operation.
Let’s Get Meta
Programming is problem solving. Both are metacognitive activities. To excel, we want to improve our thinking about thinking. Ask yourself the following questions and keep them back of mind as you proceed:

What is pseudocode?

Why do I need to learn Fizz Buzz?

What’s the Big O of Fizz Buzz?
Learn How to Write Pseudocode
Pseudocode is an approach to designing and solving algorithms using plain language rather than the syntax of a specific programming language. Writing pseudocode allows us to focus on the solution to the problem rather than the details of its implementation.
There are no hard and fast rules on how to write pseudocode. You will certainly encounter variations, but there are a few conventions that we will follow here:

Order of operations: When we write pseudocode, we still follow the flow of execution that we’re accustomed to in most programming languages. Like a programming language, we indent statements to signify code blocks and functions.

Vocabulary: There are many opinions on what constitutes the vocabulary of pseudocode and all of them are correct, but most importantly yours. Use the words that make sense to you when writing pseudocode, but keep in mind that you may not be the only one reading your “algorithm”. That said, there are some statements that seem to be universal, such as
INPUT
andOUTPUT
,FOR
,WHILE
,IFELSE
, you get the idea… 
ALL CAPS: Pseudocode is often written in all caps, with the exception of variable names, which are lower case. I like this approach as it visually distinguishes the pseudocode from most contemporary programming languages, which are primarily lowercase.
Now that we are equipped with the basics of pseudocode, let’s Fizz that Buzz!
Understand the Problem
To understand our problem, we first need to define it. Let’s reframe the problem as acceptance criteria:
GIVEN a whole number
WHEN counting up from 1 to that number
THEN “Fizz” is logged if the number is a multiple of 3, “Buzz” is logged if the number is a multiple of 5, and “FizzBuzz” if the number is a multiple of 3 and 5
That’s our general outline. We know our input conditions (a whole number) and our output requirements (multiples of 3, 5, and 3 and 5, logged as “Fizz”, “Buzz”, and “FizzBuzz”, respectively).
Let’s make a plan!
Make a Plan
What’s the smallest problem we can solve?
1
Let’s pseudocode it:
INPUT 1
IF 1 IS A MULTIPLE OF 3
OUTPUT "Fizz"
But we already know it won’t log anything. So, our smallest problem is actually 3. Our count starts at 1, so we will need to iterate from 1 to 3, then check if each value is a multiple 3.
Let’s pseudocode this…
INPUT whole number
FOR EACH number FROM 1 TO whole number
IF number IS A MULTIPLE OF 3
OUTPUT "Fizz"
ELSE
OUTPUT number
This will output:
1
2
Fizz
What’s our next smallest problem? 5. We’ll still iterate from 1 to 5, but now we need to add a conditional to check whether or not the current value, i
, is a multiple of 5.
INPUT whole number
FOR EACH number FROM 1 TO whole number
IF number IS A MULTIPLE OF 3
OUTPUT "Fizz"
ELSE IF number IS A MULTIPLE OF 5
OUTPUT "Buzz"
ELSE
OUTPUT number
Our output will now be the following:
1
2
Fizz
4
Buzz
We implemented conditionals to check for multiples of 3 and multiples of 5. Now we need a conditional check for multiples of 3 and 5.
INPUT whole number
FOR EACH number FROM 1 TO whole number
IF number IS A MULTIPLE OF 3
OUTPUT "Fizz"
ELSE IF number IS A MULTIPLE OF 5
OUTPUT "Buzz"
ELSE IF number IS A MULTIPLE OF 3 AND 5
OUTPUT "FizzBuzz"
ELSE
OUTPUT number
Looks good?
What happens if we run this program?
1
2
Fizz
4
Buzz
Fizz
7
8
Fizz
Buzz
11
Fizz
13
14
Fizz
Where’s the “Buzz”?
Following the order of operations, our program first checks for multiples of 3. If it doesn’t find a multiple of 3, it then checks for multiple of 5, and if it doesn’t find that, it then checks for multiples of 3 and 5. So when we counted to 15, we checked if 15 is a mutliple of 3, and returned “Fizz”. What’s the solution? Refactor our algorithm!
INPUT whole number
FOR EACH number FROM 1 TO whole number
IF number IS A MULTIPLE OF 3 AND 5
OUTPUT "FizzBuzz"
ELSE IF number IS A MULTIPLE OF 5
OUTPUT "Buzz"
ELSE IF number IS A MULTIPLE OF 3
OUTPUT "Fizz"
ELSE
OUTPUT number
We simply move our conditional checking for multiples of 3 and 5 to the top.
NOTE: This is something to keep in mind when designing and solving any algorithm. If you’re working with conditionals (see what I did there), start with the specific case and move to the more general.
There’s one more refactor we can make before we translate this to code. What’s another way of saying “IS A MULTIPLE OF”?
The modulo operation returns the remainder of a division operation.
What’s 3 divided by 2?
It’s 1.5, but where did we get that .5? It’s the remainder, just divided.
The quotient of 3 / 2
is 1. The remainder is 1.
The quotient of 3 / 3
is also 1. But there’s no remainder.
The quotient of 3 / 4
is 0, and the remainder is 3.
Let’s update our pseudocode to use the modulo operator:
INPUT whole number
FOR EACH number FROM 1 TO whole number
IF number MOD 3 AND 5 IS EQUAL TO 0
OUTPUT "FizzBuzz"
ELSE IF number MOD 5 IS EQUAL TO 0
OUTPUT "Buzz"
ELSE IF number MOD 3 IS EQUAL TO 0
OUTPUT "Fizz"
ELSE
OUTPUT number
Execute the Plan
Now we simply need to translate our algorithm to JavaScript.
const fizzBuzz = (n) => {
for (let i = 1; i <= n; i++){
if ((i % 3 === 0) && (i % 5 === 0)) {
console.log(i, "Fizz Buzz");
}
else if (i % 3 === 0) {
console.log(i, "Fizz");
}
else if (i % 5 === 0) {
console.log(i, "Buzz");
}
else {
console.log(i);
}
}
}
Evaluate the Plan
Can we do better?
Or worse?
We can’t improve the time complexity (see Big O below), but we can do some fancy refactoring.
Rather than checking multiple conditions in this block:
if ((i % 3 === 0) && (i % 5 === 0)) {
console.log(i, "Fizz Buzz");
}
We could simply check if the number was a multiple of 15:
if ((i % 15 === 0) {
console.log(i, "Fizz Buzz");
}
This may be difficult to read, though, especially considering the acceptance criteria specified multiples of 3 and 5.
If we wanted to show off, we could refactor our for
loop down to one line:
for(let i = 0; i < n;) console.log((++i % 3 ? '' : 'Fizz') + (i % 5 ? '' : 'Buzz')  i);
But this is even more difficult to read, let alone explain!
Reflection

What is pseudocode?

Why do I need to learn Fizz Buzz?

What’s the Big O of Fizz Buzz?
What is Pseudocode?
Pseudocode is an approach to designing and solving algorithms using plain language rather than the syntax of a specific programming language. Writing pseudocode allows us to focus on the solution to the problem rather than the details of its implementation.
Why Do I Need to Learn Fizz Buzz?
There are two primary reasons to learn Fizz Buzz:

Fizz Buzz is a common interview question, used for entrylevel whiteboarding to quickly assess whether or not you know a language before moving on to more complicated problems. It is, in many regards, the “Hello World Program” of algorithms, and can be considered a rite of passage.

The key concept used in Fizz Buzz is the modulo operator. It’s a very simple yet powerful tool available to programmers and learning to use it in this context will help you apply it in much more complicated scenarios.
What’s the Big O of Fizz Buzz?
O(n)
It’s linear. We perform one operation for every input.
If you want to learn more about linear time complexity, check out my article Big O Linear Time Complexity.
A is for Algorithms
💯 Give yourself an A. Grab your copy of A is for Algorithms