Write the code necessary to find the largest element in an unsorted array of integers. What is the time complexity of this algorithm?

Question

What will be an ideal response?

Answer 1

```
int max;
if (intArray.length > 0)
{
max = intArray[0];
for (int num = 1; num < intArray.length; num++)
if (intArray[num] > max)
max = intArray[num];
System.out.println (max);
}
else
{
System.out.println ("The array is empty.");
}
The algorithm examines each of the array. If there are n elements in the array, the time complexity of the algorithm is O(n).

```