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 →

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. Problems
  2. /A shop stores the colours of the ten bicycles in its window in an array Colours: red, blue, red…
MediumComputer ScienceHigh School (9–10)Computer Science › Algorithms and Problem-SolvingNumericalcodingIGCSE

A shop stores the colours of the ten bicycles in its window in an array Colours: red, blue, red…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A shop stores the colours of the ten bicycles in its window in an array Colours: red, blue, red, green, white, red, blue, black, red, grey. A linear search that stops at the first match is not enough: the manager wants to know how many bicycles have a given colour.

Write a pseudocode algorithm that inputs a colour, looks at every item of the array, and outputs how many items match. How many does it output for red?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Linear search: compare each item in turn from the first; stop when it is found or the list ends. Bubble sort: compare each pair of neighbours and swap them if they are in the wrong order; repeat passes until a pass makes no swaps. A pass over nnn items makes n−1n - 1n−1 comparisons at most.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

A model answer.

pseudocode
DECLARE Colours : ARRAY[1:10] OF STRING
INPUT Wanted
Matches ← 0
FOR Index ← 1 TO 10
    IF Colours[Index] = Wanted
      THEN
        Matches ← Matches + 1
    ENDIF
NEXT Index
OUTPUT Matches

The run. Red is at the indexes 111, 333, 666 and 999, so the output is 444.

Answer: 444.

Watch out. A WHILE loop with a Found flag would stop at index 111. Here every item must be checked, so a FOR loop is the right choice.

Log in to save this for later
← All Problems
← A bubble sort puts the scores 5, 1, 4, 2, 8 into ascending order…A bubble sort is changed so that it sorts in descending order: the comparison becomes IF… →
More onComputer Science › Algorithms and Problem-Solving

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Linear search and bubble sortStandard Algorithms: Totals, Searching, Sorting and Validation

More on this topic

  1. This is the kind of long scenario question that ends Paper 2…Hard
  2. A delivery company adds a check digit to each parcel number…Medium
  3. Name the check in each case. Say whether it is validation or verification…Easy
A bubble sort is changed so that it sorts in descending order: the comparison becomes IF…Hard
  • A bubble sort puts the scores 5, 1, 4, 2, 8 into ascending order…Medium
  • All problems on this topic →