C PROGRAMMING PROGRAM • POINTERS & DYNAMIC MEMORY

Traverse an Array Using a Pointer

Learn how to traverse an array using a pointer using a clear C program.

BeginnerPointer arithmeticArray decayTraversal

PROBLEM UNDERSTANDING

Input and expected output

Sample input

No input required

Sample output

3 6 9 12 15

COMPLETE C PROGRAM

Complete C implementation

#include <stdio.h>

int main(void)
{
    int values[] = {3, 6, 9, 12, 15};
    int *pointer = values;
    size_t length = sizeof values / sizeof values[0];
    for (size_t index = 0; index < length; index++) printf("%d ", *(pointer + index));
    putchar('\n');
    return 0;
}

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

3 6 9 12 15

0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

Read the required input values.
Move by element-sized pointer offsets and dereference each resulting address.
Display the computed result.

Move by element-sized pointer offsets and dereference each resulting address.

EFFICIENCY

Time and space complexity

Time complexity

O(n)

Auxiliary space

O(1)

DEBUGGING CHECKLIST

Common mistakes

Check this

Use the correct format specifier for every variable.

Check this

Initialize variables before using their values.

Check this

Check braces, semicolons and input order carefully.

Try it yourself

Practice: Run the program with the sample input, predict its output, and then test one boundary case of your own.