Introduction

Before you write a computer program, you need to plan how the program will work. This plan is called an algorithm. Writing an algorithm is like drawing a blueprint before building a house — it helps you organize your thoughts, define the logic, and avoid mistakes.

There are three popular ways to write algorithms: Natural Language, Pseudocode, and Flowchart. Each has its strengths and is used based on the audience and complexity of the problem.

What is an Algorithm?

An algorithm is a finite sequence of well-defined instructions used to solve a problem. It takes some input, processes it, and produces the required output.

Why Write Algorithms?

Writing an algorithm before coding brings many benefits. Let's explore the main reasons why algorithms are essential.

Ways to Write Algorithms

Algorithms can be written in three main ways, each suited for different audiences and purposes.

A. Natural Language

The Natural Language approach uses simple, everyday English to describe the steps of an algorithm. It's the easiest way to start and requires no special knowledge.

Advantages

Disadvantages

Example — Find Largest of Two Numbers (Natural Language)

1. Start
2. Take two numbers A and B
3. If A > B then A is largest
4. Else B is largest
5. Display the largest number
6. Stop

B. Pseudocode

Pseudocode combines simple English with programming style. It uses keywords like START, INPUT, IF, THEN, ELSE, PRINT, and STOP but doesn't follow strict syntax of any programming language.

Advantages

Common Pseudocode Keywords

Example — Find Largest of Two Numbers (Pseudocode)

START
INPUT A, B
IF A > B THEN
    LARGEST ← A
ELSE
    LARGEST ← B
ENDIF
PRINT LARGEST
STOP

C. Flowchart

A Flowchart represents an algorithm using standard symbols and arrows. It's a visual way to see the flow of logic, making it easier to understand complex decisions and loops.

Common Flowchart Symbols

Example — Find Largest of Two Numbers (Flowchart)

Start (Oval)
   ↓
Input A, B (Parallelogram)
   ↓
Is A > B? (Diamond)
   ├── Yes → LARGEST = A (Rectangle)
   └── No  → LARGEST = B (Rectangle)
   ↓
Print LARGEST (Parallelogram)
   ↓
Stop (Oval)

Steps to Write an Algorithm

Follow these 8 essential steps every time you write an algorithm.

Step 1: Understand the Problem

Step 2: Analyze the Problem

Step 3: Identify Inputs and Outputs

Step 4: Develop the Logic

Step 5: Represent the Algorithm

Step 6: Test the Algorithm

Step 7: Refine and Debug

Step 8: Implement (Coding)

Example — Find Largest of Two Numbers

Let's compare a good algorithm with a bad one for the same problem.

1. Start
2. Input two numbers A and B
3. If A > B then L = A
   Else L = B
4. Print L
5. Stop

1. Start
2. Take two numbers
3. Compare somehow
4. Do some processing
5. Display the largest number
6. Go to step 3
7. Stop (maybe)

Characteristics of a Good Algorithm

A well-written algorithm satisfies these 9 essential characteristics.

More Complete Examples

Example 1: Check if a Number is Even or Odd

Natural Language

1. Start
2. Take a number N
3. If N is divisible by 2, then it's Even
4. Otherwise, it's Odd
5. Display the result
6. Stop

Pseudocode

START
INPUT N
IF N MOD 2 == 0 THEN
    PRINT "Even"
ELSE
    PRINT "Odd"
ENDIF
STOP

Example 2: Sum of First N Natural Numbers

Pseudocode

START
INPUT N
SUM ← 0
FOR i ← 1 TO N
    SUM ← SUM + i
ENDFOR
PRINT SUM
STOP

Example 3: Calculate Factorial of N

Pseudocode

START
INPUT N
FACT ← 1
FOR i ← 1 TO N
    FACT ← FACT * i
ENDFOR
PRINT FACT
STOP

Example 4: Find Area of a Rectangle

Pseudocode

START
INPUT L, B
AREA ← L * B
PRINT AREA
STOP

Comparison of Writing Methods

Did You Know?

Tips for Writing Better Algorithms

Common Mistakes to Avoid

Frequently Asked Questions

Q1. What are the 3 ways to write algorithms?

The 3 main ways are: Natural Language, Pseudocode, and Flowchart.

Q2. Which is the best way to write algorithms?

It depends on the audience. Use natural language for beginners, pseudocode for programmers, and flowcharts for complex visual logic.

Q3. What is pseudocode?

Pseudocode is a way to write algorithms using English-like statements with programming keywords like IF, THEN, ELSE, PRINT — without being tied to any specific programming language.

Q4. Is pseudocode a programming language?

No! Pseudocode is NOT a programming language. It cannot be executed. It's just a way to describe algorithms clearly.

Q5. When should I use a flowchart?

Use flowcharts for algorithms with complex decisions, loops, and multiple paths where visual representation helps understanding.

Q6. Can I write the same algorithm in all three ways?

Yes! The same algorithm can be represented in natural language, pseudocode, or flowchart. Each is a different way to express the same logic.

Q7. Do I need to write an algorithm before coding?

Highly recommended! Writing an algorithm helps you plan, avoid mistakes, and produce cleaner, more efficient code.

Q8. What tools can I use to draw flowcharts?

Popular tools include Draw.io, Lucidchart, Microsoft Visio, Canva, and even PowerPoint.

Q9. How long should an algorithm be?

An algorithm should be as long as needed to clearly express the logic — no more, no less. Focus on clarity, not length.

Q10. Can algorithms have loops and conditions?

Absolutely! Loops (FOR, WHILE) and conditions (IF, ELSE) are common constructs used in algorithms to handle repetition and decision-making.