HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Algorithms and Problem-Solving
  2. /Computer Science
  3. /Standard Algorithms: Totals, Searching, Sorting and Validation
Chapter 7 · Part 3 of 3Algorithms and Problem-Solving
← Previous part: Pseudocode, Trace Tables and Testing
High School (9–10)Algorithms, Programming and Logic › Algorithms and Problem-SolvingFree course

Standard Algorithms: Totals, Searching, Sorting and Validation

Some small algorithms turn up in almost every program.

  • Adding up a list of numbers, counting how many pass a test, finding the highest score, searching for a name and putting values in order.
  • You learn to write each one in pseudocode and in Python, and to check the data a user types in before a program uses it.
  • It covers the standard methods of solution and the validation and verification checks of unit 7 of Cambridge IGCSE Computer Science.

3 lessons, about 1 h 15 min3 simulations10 problems3 practice questionsPython in every lesson

StemPy LabCreated by StemPy Lab

Free

Every lesson is open to read. Enroll to keep your place in the course. No payment needed.

This course includes

  • 3 lessons, about 1 h 15 min
  • 3 simulations with sliders
  • 3 practice questions with new numbers each time
  • 3 Python programs to run
  • 10 problems with worked solutions
  • 2 Python labs
1 question set
  • 1 revision note
  • 1 test
  • Log in to save

    Course outline (3 lessons)

    1. 1
      Lesson 1about 25 min

      Totalling, counting, maximum, minimum and average

      Some small algorithms appear in almost every program. You learn to total a set of values, count the ones that meet a condition, and find the maximum and minimum. Then you work out the average, in pseudocode and in Python, with the right starting values.

      1 simulation1 practice question1 Python program3 problems1 Python lab
      Read the lesson
    2. 2
      Lesson 2about 25 min

      Linear search and bubble sort

      A linear search looks through a list item by item until it finds what it wants. A bubble sort puts a list in order by comparing neighbours and swapping them. You write both in pseudocode, dry-run them, and count their comparisons and passes.

      1 simulation1 practice question1 Python program4 problems1 Python lab
      Read the lesson
    3. 3
      Lesson 3about 25 min

      Validation and verification

      A program must not trust the data a person types. Validation checks that data is sensible: range, length, type, presence and format checks, and the check digit. Verification checks that data was entered as intended: a visual check and a double entry check. You write the checks in pseudocode and Python.

      1 simulation1 practice question1 Python program3 problems1 question set1 note
      Read the lesson

    Test Your Learning

    Standard Algorithms: Chapter Test
    IGCSE format20 questions · 25 min
    Not started

    Your teacher

    StemPy LabStemPy Lab

    1 follower

    Loading…

    ← All Courses
    ← Pseudocode, Trace Tables and TestingNext →
    More onAlgorithms, Programming and Logic › Algorithms and Problem-Solving

    Discussion (0)

    Log in to join the discussion.

    Loading…