C PROGRAMMING PROGRAM • POINTERS & DYNAMIC MEMORY

Allocate a Zero-Initialized Array with calloc()

Learn how to allocate a zero-initialized array with calloc() using a clear C program.

Intermediatecalloc()Dynamic arrayfree()

PROBLEM UNDERSTANDING

Input and expected output

Sample input
4
6 8 10 12
Sample output
Average = 9.00

COMPLETE C PROGRAM

Complete C implementation

calloc-array-average.c
Open in compiler
#include <stdio.h>
#include <stdlib.h>

int main(void)
{
    size_t count;
    printf("Enter number of values: ");
    scanf("%zu", &count);
    if (count == 0) { puts("Count must be positive."); return 0; }
    double *values = calloc(count, sizeof *values);
    if (values == NULL) { puts("Allocation failed."); return 1; }
    double sum = 0;
    printf("Enter values: ");
    for (size_t index = 0; index < count; index++) {
        scanf("%lf", &values[index]);
        sum += values[index];
    }
    printf("Average = %.2f\n", sum / (double) count);
    free(values);
    return 0;
}

GUIDED CODE TOUR • NOT LIVE EXECUTION

Study the program line by line

Use the real compiler button above to run and debug with different inputs.

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

Average = 9.00
0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

  1. Read the required input values.
  2. Allocate cleared storage for the requested count, calculate the average and release the block.
  3. Display the computed result.

Allocate cleared storage for the requested count, calculate the average and release the block.

EFFICIENCY

Time and space complexity

Time complexity

O(n)

Auxiliary space

O(n)

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.