Linear Search Flashcards

1️⃣ Familiarise yourself with the flashcards:

Look through all the flashcards to see what's on both sides.
Make sure you understand the information on each card. If something's unclear, click the link to the revision notes at the bottom of the page for more details.

2️⃣ Test yourself:

Look at the question or prompt on each card and try to remember the answer before flipping it over.
Check the answer and make a note of any cards you find challenging and need to go over more.

3️⃣ Consistently Review and Practice:

Use spaced repetition: spend more time on the cards you struggle with and go over them more often.
Regularly review all the flashcards to help you better understand and retain the information over time.

Note: We may include questions that have multiple correct answers. It's useful to remember specific examples to understand these concepts better.

PERSONALISED 1-TO-1 TUTORING

Get support with clear explanations, practice and feedback (Ages 5 to 16).

Want an ad-free experience? Subscribe to remove ads

What is a linear search?

A simple search that checks each item in a list in order to find a target.

Start at the first item. Compare it to the target. If it matches, return the position. If not, move to the next item. Repeat until found or the end.

No. It works on unsorted or sorted lists.

The position (index) of the item in the list.

It reports that the item is not found.

One, if the first item matches.

The same as the number of items in the list.

Linear time, written as O(n).

It is easy to code and works on any list.

It can be slow on large lists.

The first match it meets in the list.

Three, because it checks 3, then 8, then 5.