O(n)
← Back to Linear Search
Linear time complexity. The algorithm’s running time grows proportionally with the input size. Linear search must examine each element once in the worst case, resulting in O(n) time.
← Back to Linear Search
Linear time complexity. The algorithm’s running time grows proportionally with the input size. Linear search must examine each element once in the worst case, resulting in O(n) time.