ConceptStep · learning platform for computer science

Linear search

C programming · Lesson

C · lesson 18 / 27

Linear search

Compare the target with one cell at a time and keep the current index visible.

1 · Observe and predict

The concept

Linear search skips no elements: in the worst case it must inspect the whole array. The returned index identifies the position, not the value itself.

Mental model:

i=0 → v[i] == target? → no: i++ · yes: store i

2 · Flowchart + Array Lab

Follow the same algorithm as a flowchart

The flowchart keeps algorithm control visible; the Array Lab below makes cells, indices, comparisons, candidates and swaps visible.

Loading flowchart…
3 · Array / Search / Sorting Visualizer

Watch the data change step by step

Indices stay visible at all times. Sorting traces highlight comparisons, the current candidate, swaps and the region already sorted.

1 / 7

Start from the left

Compare one element at a time with target value 9.

target = 9
target9
4 · Flowchart ↔ C · Run in Page

Lab 1 — Run the example program

Run C executes only the example shown on the left, using stdin on the right. The coding challenge below has a separate editor and test button.

Linear search Start the flowchart to synchronize the code
                        1#include <stdio.h>
                        2 
                        3int main(void)
                        4{
                        5    int v[5] = {4, 7, 2, 9, 1};
                        6    int cercato = 9;
                        7    int trovato = -1;
                        8 
                        9    for (int i = 0; i < 5; i = i + 1)
                        10    {
                        11        if (v[i] == cercato)
                        12            trovato = i;
                        13    }
                        14 
                        15    printf("%d\n", trovato);
                        16    return 0;
                        17}
Ready. Make a prediction before running.

                    
                

Lab 2 — Coding challenge: write your code — First position

Read five integers and then a target; print the first index or -1.

This is a different program from lab 1. Complete the starter code: Check all test cases compiles this editor and tests every input, including boundary cases.

5 · Guided practice

Check your prediction

In {4, 7, 2, 9, 1}, at which index is 9 located?

Challenge 1 / 5 · Understanding

Progress: 0 / 5 · correct: 0

Your competency map

What you need to know for Linear search

ConceptStep separates what is required from what is recommended or useful as reinforcement. Only required prerequisites block your progress.

Current topic Strong skill Review due Needs reinforcement To be mastered Optional support

Relationships: solid line = required · dashed line = recommended · dotted line = reinforcement.

GUIDED LEARNING PATHS

Want to choose the next skill to develop?