C program to find largest element in an array

Given an array, find the largest element in it.

The solution is to initialize max as first element, then traverse the given array from second element till end. For every traversed element, compare it with max, if it is greater than max, then update max.

#include <stdio.h>   // C function to find maximum in arr[] of size n int largest(int arr[], int n) {     int i;          // Initialize maximum element     int max = arr[0];       // Traverse array elements from second and     // compare every element with current max      for (i = 1; i < n; i++)         if (arr[i] > max)             max = arr[i];       return max; }   int main() {     int arr[] = {10, 324, 45, 90, 9808};     int n = sizeof(arr)/sizeof(arr[0]);     printf("Largest in given array is %d", largest(arr, n));     return 0; }

Output:

Largest in given array is 9808

Time complexity of the above solution is .

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above