ADVANCED DATA STRUCTURES PROGRAM • LEVEL 8 — PERFORMANCE ANALYSIS

Measure Binary Search Comparisons

Learn how to measure binary search comparisons using a clear C program.

IntermediateOperation countingAsymptotic analysis

PROBLEM UNDERSTANDING

Input and expected output

Sample input

No input required

Sample output

Comparisons = 5

COMPLETE C PROGRAM

Complete C implementation

#include <stdio.h>

int main(void)
{
    int values[31], target = 31, low = 0, high = 30, comparisons = 0;
    for (int index = 0; index < 31; index++) values[index] = index + 1;
    while (low <= high) {
        int middle = low + (high - low) / 2;
        comparisons++;
        if (values[middle] == target) break;
        if (values[middle] < target) low = middle + 1; else high = middle - 1;
    }
    printf("Comparisons = %d\n", comparisons);
    return 0;
}

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

Comparisons = 5

0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

Read the required input values.
Count comparisons while binary search repeatedly discards half of the range.
Display the computed result.

Count comparisons while binary search repeatedly discards half of the range.

EFFICIENCY

Time and space complexity

Time complexity

O(log 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.