C program to find the largest element in an array using simple iteration

August 16, 2026

Merge Sort in C++

Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...

🔍 Find Largest Element in an Array (C Program)

#include<stdio.h> int main( ) { int num,a[100]; printf("Enter the size of the array:\n"); scanf("%d",&num); if(num<=0) { printf("Invalid array size"); return 1; } printf("Enter %d elements into the array:\n", num); for(int i=0;i<num;i++) { scanf("%d",&a[i]); } int max=a[0]; for(int i=0;i<num;i++) { if(a[i]>max) { max=a[i]; } } printf("The largest element in array is %d\n",max); }

📘 Explanation:

🔹 The program first reads the size and elements of the array.
🔹 It initializes `max` with the first element.
🔹 Then it iterates through all elements and updates `max` whenever a larger value is found.
🔹 Finally, it prints the largest element.

🧪 Sample Output:

Enter the size of the array:
5
Enter 5 elements into the array:
10 45 23 89 34
The largest element in array is 89

🏷️ Keywords:

C program largest element, find max in array, array maximum value, beginner array program, C logic for max element

Search This Blog

1PRINTF

Featured

Merge Sort in C++