Which algorithm is characterized as a linear-time approach that checks each element in sequence?

Which algorithm is characterized as a linear-time approach that checks each element in sequence?

• A. Binary Search
• B. Bubble Sort
• C. Linear Algorithm
• D. Merge Sort

Answer: (C)

A linear-time algorithm processes each element once in a single pass, so the running time grows directly with the input size. When an approach checks every element in sequence, it does a constant amount of work for each item, leading to a total effort proportional to n. This is exactly what a linear algorithm represents: a straightforward scan that visits every item exactly once. Binary search isn’t that pattern—it's about halving the search space each step, which yields logarithmic time. Bubble sort and merge sort involve multiple passes or splits and merges, respectively, resulting in times that grow faster than linear (quadratic for bubble sort, n log n for merge sort). Therefore, the description fits best with the linear-time, single-pass approach.

A linear-time algorithm processes each element once in a single pass, so the running time grows directly with the input size. When an approach checks every element in sequence, it does a constant amount of work for each item, leading to a total effort proportional to n. This is exactly what a linear algorithm represents: a straightforward scan that visits every item exactly once.

Binary search isn’t that pattern—it's about halving the search space each step, which yields logarithmic time. Bubble sort and merge sort involve multiple passes or splits and merges, respectively, resulting in times that grow faster than linear (quadratic for bubble sort, n log n for merge sort). Therefore, the description fits best with the linear-time, single-pass approach.