Skip to main content

Posts

Showing posts with the label optimized approach for largest element in an array

Finding Largest Element in an Array

Optimized Approach for Finding Largest Element in an Array . Approach: 1) Initialize a variable named "largest" with first element of an array. 2) Compare the "largest" with every element in an array . 3) If element in the array (arr[i]) is greater than "largest" then initialize "largest" with that element i.e arr[i]. 4) Print "largest" which is the largest element in the array. Program: #include<iostream> using namespace std; int main() { int n,largest; cin>>n; int arr[n]; for(int i=0;i<n;i++) { cin>>arr[i]; } largest=arr[0]; for(int i=1;i<n;i++) { if(arr[i]>largest) { largest=arr[i]; } } cout<<"Largest Element in an array is:"<<largest; return 0; } Output: Time Complexity : O(N)