What is an Algorithm? What is Problem Solving?

01 What Do We Actually Tell a Computer to Do?

Imagine handing a slip of paper with numbers written on it to a friend and asking:

“Could you find the largest number on this paper for me?”

Here, you posed a problem. In a split second, your friend scans the numbers visually and answers: “The largest number is 95.”

However, if you simply tell a computer “find the largest number”, it has no clue what to do. Computers lack human intuition, common sense, and visual gestalt. To make a machine solve this problem, you must prescribe every atomic, unambiguous step:

This structured sequence of logical, deterministic steps is what we call an Algorithm.

02 What is an Algorithm?

In straightforward terms:

In computer science, a well-formed algorithm possesses six essential characteristics:

Algorithms are not restricted to computers. Human civilization and daily routines have relied on algorithmic procedures long before computers existed.

03 Everyday Life Algorithms

Consider a familiar daily routine: preparing a cup of milk tea.

What happens if you invert the sequence—pouring cold milk and raw tea leaves into an empty cup without boiling water? You won't get tea! The exact order and validity of steps are indispensable to producing the correct outcome.

04 Are Algorithm and Program the Same Thing?

No. While closely related, they represent two entirely distinct layers in computer science:

A Concrete Code Illustration:

Problem: “Find the maximum number in a list.”

Now we implement this abstract algorithm in Python:

# Program: Python Implementation
numbers = [8, 3, 15, 6, 10]

# Step 1: Initialize largest with the first element
largest = numbers[0]

# Step 2 & 3: Iterate and conditionally update
for number in numbers:
    if number > largest:
        largest = number

# Step 4: Output the result
print(f"The largest number is: {largest}")

Here, the Python code is the Program. The reasoning and steps behind it are the Algorithm. If tomorrow you write this in Rust, Java, or C#, the syntax will change, but the underlying algorithm remains identical!

05 Multiple Algorithms for One Problem

One of the most profound realizations in algorithmic thinking is: rarely is there only one way to solve a given computing problem.

Suppose you are given a dataset containing 1,000,000 numbers and asked to find if the number 452,873 exists.

06 Why Are Algorithms Crucial?

Imagine two distinct algorithms that solve the exact same business task.

Both solutions are technically “correct”. But in the real world, a 10-minute operation renders software unusable. When your user base scales from 1,000 to 10,000,000, inefficient algorithms crash servers. A superior algorithm delivers:

• Time Efficiency: Delivers results in milliseconds even across petabytes of data.
• Memory Conservation: Uses minimal server RAM, preventing out-of-memory crashes.
• Scalability: Withstands sudden surges in user traffic without degradation.
• Cost Reduction: Consumes far fewer CPU cycles, slashing cloud infrastructure costs by thousands of dollars monthly.

This is why professional software engineering moves beyond simply asking “Does the code work?” to demanding: “How efficiently does it scale?”

07 What is Problem Solving Really?

A common pitfall among aspiring developers is jumping straight into a code editor the moment a problem is presented. Seasoned software engineers do the exact opposite: they spend most of their time breaking down and analyzing the problem before typing a single line of code.

The 10-Step Problem-Solving Framework:

08 A Practical Example: Searching Across 10,000 Student Records

Imagine a high school administrative ledger containing 10,000 registered student records. You need to answer:

“Who is the student with ID 7821?”

10,000 operations compared to 14! This exponential speedup wasn't created by upgrading hardware; it was unlocked purely by picking a superior algorithm.

09 The Relationship Between Data Structures and Algorithms

In 1976, Turing Award laureate Niklaus Wirth titled his landmark textbook with this foundational formula:

To build great software, you must master both halves of this equation:

They are two sides of the same coin:

• A Hash Table requires a Hashing Algorithm to distribute keys.
• A Binary Search Tree relies on a BST Traversal Algorithm.
• A Graph relies on Dijkstra's or A* Shortest Path Algorithms.

10 Are Algorithms Only for Programming?

Not at all. Algorithmic decision systems actively govern modern civilization every second of every day:

11 Algorithmic Thinking: Categorizing Problem Archetypes

Exceptional software engineers do not just memorize language APIs; they look at a real-world scenario and immediately recognize its underlying mathematical pattern:

The moment you inspect an ambiguous business requirement and recognize—“This is actually a shortest-path optimization problem!”—you have unlocked true Algorithmic Thinking.

12 A Vital Mindset Shift: Syntax vs. Problem-Solving Logic

Many beginner programmers believe:

“If I memorize every keyword and syntax trick in Python, I will become a great programmer.”

This is an illusion. Syntax is just a hammer. If a carpenter does not understand load bearing, wood grain, or structural balance, owning a gold-plated hammer will not help them build a sturdy table.

13 What Will We Learn in This Course?

Our goal in this course is not passive memorization. We will build a complete end-to-end thinking pipeline:

Across 12 masterclass lessons, we will explore: