A programmer needs to search a list of 1000 names that are stored in random order. Which search method should be used and why?

Q: How do I try a free CIE Computer Science question?

Just tap any of the four options on this page — no signup, no card, nothing to install. You'll see the correct answer and a full mark-scheme-style explanation within a second. Each visit shows a fresh randomly-picked question from the live CIE IGCSE Computer Science bank, so you can keep refreshing to try different ones before deciding whether to create a free account for daily access.

Q: Is Kramizo really free for CIE Computer Science students?

Yes — completely free. Every student gets 45 questions a day on the free plan, across any board and any subject, with no card required and no trial countdown. Kramizo's optional Pro plan removes the daily cap and adds analytics, but the free plan is genuinely free forever. We make money from the small percentage of students who choose to upgrade — not from selling data or ads.

Q: Are the Computer Science questions aligned to the CIE IGCSE syllabus?

Every question is written against the published CIE IGCSE Computer Science syllabus and reviewed for accuracy before being added to the bank. We match the command words (state, describe, explain, evaluate), mark allocations, and difficulty tier you'll see on real CIE past papers. Explanations are written in the style of official examiner mark schemes so students learn exactly what marks are being awarded for.

Question

A programmer needs to search a list of 1000 names that are stored in random order. Which search method should be used and why?

Accepted Answer

Linear search, because the list is not sorted and binary search requires sorted data — Binary search requires the list to be sorted before it can be applied; on an unsorted list it cannot work correctly. Linear search checks each item sequentially and works on any list regardless of order, making it the correct choice here.

Answer

Linear search, because it uses fewer comparisons on large lists

Answer

Binary search, because it works efficiently on unsorted data

Answer

Linear search, because the list is not sorted and binary search requires sorted data

Answer

Binary search, because it is always faster than linear search

One real Computer Science question.No signup. 30 seconds.

One real Computer Science question.
No signup. 30 seconds.