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 club keeps its eight members in an array in the order they joined: Ines, Kofi, Hana, Luis, Ama…
EasyComputer ScienceHigh School (9–10)Computer Science › Algorithms and Problem-SolvingNumericalIGCSE

A club keeps its eight members in an array in the order they joined: Ines, Kofi, Hana, Luis, Ama…

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 club keeps its eight members in an array in the order they joined: Ines, Kofi, Hana, Luis, Ama, Pavel, Sara and Yuki. A linear search starts at the first name.

  1. How many comparisons does it make to find Ama?
  1. How many does it make for Bruno, who is not a member?

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.

Step 1. Ama is at index 555. The search compares Ines, Kofi, Hana, Luis and then Ama: 555 comparisons.

Step 2. Bruno is not in the list, so every one of the 888 names is compared before the search can say "not found".

Answer: (a) 555; (b) 888.

What if? If the club sorted its list by name, a linear search would still work. The number of comparisons would change, because the order changes.

Log in to save this for later
← All Problems
← This is the kind of long scenario question that ends Paper 2…A bubble sort puts the scores 5, 1, 4, 2, 8 into ascending order… →
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 shop stores the colours of the ten bicycles in its window in an array Colours: red, blue, red…Medium
  • All problems on this topic →