0478/0984 iGCSE Computer Science - Unit 7 Lesson 8: Pseudocode - Linear Search and Bubble Sort

📌 0478/0984 iGCSE Computer Science - Lesson 8: Linear Search & Bubble Sort Welcome to Lesson 8 of the iGCSE Computer Science (0478/0984) course. In this lesson, we’ll learn two essential algorithms you need for your Paper 2 exam: Linear Search for finding values in a list, and Bubble Sort for sorting data in order. 🎥 Lesson Breakdown: 0:00 – Introduction 0:50 – What is a Linear Search? 2:30 – Writing Pseudocode for Linear Search 5:15 – What is a Bubble Sort? 8:25 – How Bubble Sort Works (Step-by-Step Example) 11:25 – Writing Pseudocode for Bubble Sort 19:00 – Practice Questions & Exam-Style Problems 🔹 Topics Covered: ✅ Understanding how Linear Search checks each item in a list ✅ Writing clear pseudocode for a Linear Search algorithm ✅ Learning how Bubble Sort compares and swaps values to sort a list ✅ Writing efficient pseudocode for Bubble Sort ✅ Recognising where these algorithms are used in real problems ✅ Practising with exam-style questions to build confidence 📚 Perfect for: ✔️ iGCSE Computer Science students preparing for Paper 2 (Algorithms & Pseudocode) ✔️ Anyone looking to strengthen their knowledge of basic search and sort algorithms ✔️ Teachers & educators seeking structured, exam-focused lesson content 🔔 Subscribe for more iGCSE Computer Science lessons! 📖 Lesson slides and resources available here: https://cswithmrg.gumroad.com/?sectio... 💬 Got questions? Drop them in the comments!