In a linear search algorithm, each element of the array is checked one by one until the target element is found or the end of the array is reached. In the worst case, where the target element is at the last position or absent from the array, the algorithm will need to examine all n elements. Therefore, the time complexity of a linear search is linear, denoted as O(n).