// Java Program to do Sequential Search find maximum in arr[] class LargestValue { static int arr[] = {10, 324, 45, 90, 9}; // original {10, 324, 45, 90, 9808} // Method to find maximum in arr[] static int largest() { // Initialize maximum element int max = arr[0]; int i = 0; // Traverse array elements from second and // compare every element with current max for (i = 1; i < arr.length; i++) if (arr[i] > max) max = arr[i]; //System.out.println("i= " + i); return max; } // Driver method public static void main(String[] args) { System.out.println("After searching all elements " + "the largest value in given array is " + largest()); } }

Number of times = N times = T(N). What is the entire program's Total Time, T(N), taken in its Worst Case?