What is an Algorithm? The Recipe Behind the Code

WHAT IS AN ALGORITHM? THE RECIPE BEHIND THE CODE Before writing code in a programming language, you must design an algorithm. An algorithm is a step-by-step, finite sequence of instructions written to solve a specific problem or complete a task. Computers cannot figure out what to do on their own; they follow instructions literally. An algorithm defines the logical path the computer must follow. THE CAKE RECIPE ANALOGY A recipe for baking a cake is a physical algorithm. It takes inputs, performs ordered steps, and yields an output. Inputs: Flour, sugar, eggs, butter, milk. Steps in Sequence: 1. Preheat the oven to 175 degrees Celsius. 2. Mix the dry ingredients in a bowl. 3. Whisk the wet ingredients in a separate bowl. 4. Combine dry and wet ingredients. 5. Pour the batter into a pan. 6. Bake for 30 minutes. Output: A baked cake. If you change the order of the steps—such as baking the dry ingredients before mixing in the eggs—the process fails. Algorithms require the same strict logical ordering. THE THREE BUILDING BLOCKS OF ALGORITHMS In computer science, all algorithms are built using three core structures: 1. SEQUENCE Executing tasks one after another, in a specific order. Example: Get user input, process the input, display the output. 2. SELECTION (DECISION) Choosing a path based on a condition. Example: IF the user's password matches the database, grant access. ELSE, show a login error. 3. ITERATION (REPETITION) Repeating a task until a specific goal is achieved. Example: While there are unsorted files in the directory, process the next file. CONCLUSION A fast computer running a poor algorithm will run slowly. A slower computer running an efficient algorithm can process data instantly. Understanding how to structure logic step-by-step is the foundation of clean engineering. Reference: "Computer-Programming.pdf", Syllabus & Steps in Problem Solving.