What is the time complexity of a linear search in an unsorted array?*1 pointA. O(1)B. O(log n)C. O(n)D. O(n^2)

To determine the time complexity of a linear search in an unsorted array, we need to analyze the steps involved in the search algorithm.

1. Start at the beginning of the array.
2. Compare the target element with each element in the array.
3. If a match is found, return the index of the element.
4. If the end of the array is reached without finding a match, return -1.

Since the array is unsorted, we cannot make any assumptions about the order of the elements. Therefore, we need to compare the target element with each element in the array, one by one.

In the worst-case scenario, the target element is not present in the array, and we need to compare it with every element. This means that the number of comparisons is directly proportional to the size of the array, n.

Hence, the time complexity of a linear search in an unsorted array is O(n), where n represents the size of the array.

Therefore, the correct answer is C. O(n).