Largest gap in an array in C++

In this tutorial, we are going to write a program that finds the largest difference between the two elements in the given array.

Let's see the steps to solve the problem.

• Initialise the array.
• Find the max and min elements in the array.
• Return max - min.

Example

Let's see the code.

 Live Demo

#include <bits/stdc++.h>
using namespace std;
int findLargestGap(int arr[], int n) {
   int max = arr[0], min = arr[0];
   for (int i = 0; i < n; i++) {
      if (arr[i] > max) {
         max = arr[i];
      }
      if (arr[i] < min) {
         min = arr[i];
      }
   }
   return max - min;
}
int main() {
   int arr[] = {3, 4, 1, 6, 5, 6, 9, 10};
   cout << findLargestGap(arr, 8) << endl;
   return 0;
}

Output

If you run the above code, then you will get the following result.

9

Conclusion

If you have any queries in the tutorial, mention them in the comment section.

Hafeezul Kareem

Published on 09-Apr-2021 13:26:16

• Related Questions & Answers
• Largest Gap in Python
• Kth Largest Element in an Array
• Program to find largest element in an array in C++
• Maximum Gap in C++
• Kth Largest Element in an Array in Python
• Split Array Largest Sum in C++
• C++ Program to Find Largest Element of an Array
• Constructing largest number from an array in JavaScript
• C# Program to find the largest element from an array
• Java program to find Largest, Smallest, Second Largest, Second Smallest in an array
• Python Program to find largest element in an array
• C program to find the second largest and smallest numbers in an array
• Java program to find the largest number in an array
• Python Program to find the largest element in an array
• Finding the largest non-repeating number in an array in JavaScript