Given an array **arr[]** consisting of integers, the task is to split the given array into two sub-arrays such that difference between their maximum elements is minimum.

**Example:**

Input:arr[] = {7, 9, 5, 10}

Output:1

Explanation:

The subarrays are {5, 10} and {7, 9} with the difference between their maximums = 10 – 9 = 1.

Input:arr[] = {6, 6, 6}

Output:0

**Approach:**

We can observe that we need to split the array into two subarrays such that:

- If the maximum element occurs more than once in the array, it needs to be present in both the subarrays at least once.
- Otherwise, the largest and the second-largest elements should be present in different subarrays.

This ensures that the difference between the maximum elements of the two subarrays is maximized.

Hence, we need to sort the array, and then the difference between largest 2 elements, i.e. arr[n – 1] and arr[n – 2], is the required answer.

Below is the implementation of the above approach:

## C++

`// C++ Program to split a given ` `// array such that the difference ` `// between their maximums is minimized. ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `int` `findMinDif(` `int` `arr[], ` `int` `N) ` `{ ` ` ` `// Sort the array ` ` ` `sort(arr, arr + N); ` ` ` ` ` `// Return the difference ` ` ` `// between two highest ` ` ` `// elements ` ` ` `return` `(arr[N - 1] - arr[N - 2]); ` `} ` ` ` `// Driver Program ` `int` `main() ` `{ ` ` ` ` ` `int` `arr[] = { 7, 9, 5, 10 }; ` ` ` `int` `N = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` ` ` `cout << findMinDif(arr, N); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java Program to split a given array ` `// such that the difference between ` `// their maximums is minimized. ` `import` `java.util.*; ` ` ` `class` `GFG{ ` ` ` `static` `int` `findMinDif(` `int` `arr[], ` `int` `N) ` `{ ` ` ` ` ` `// Sort the array ` ` ` `Arrays.sort(arr); ` ` ` ` ` `// Return the difference between ` ` ` `// two highest elements ` ` ` `return` `(arr[N - ` `1` `] - arr[N - ` `2` `]); ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `arr[] = { ` `7` `, ` `9` `, ` `5` `, ` `10` `}; ` ` ` `int` `N = arr.length; ` ` ` ` ` `System.out.println(findMinDif(arr, N)); ` `} ` `} ` ` ` `// This code is contributed by offbeat ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 Program to split a given ` `# array such that the difference ` `# between their maximums is minimized. ` `def` `findMinDif(arr, N): ` ` ` ` ` `# Sort the array ` ` ` `arr.sort() ` ` ` ` ` `# Return the difference ` ` ` `# between two highest ` ` ` `# elements ` ` ` `return` `(arr[N ` `-` `1` `] ` `-` `arr[N ` `-` `2` `]) ` ` ` `# Driver Program ` `arr ` `=` `[ ` `7` `, ` `9` `, ` `5` `, ` `10` `] ` `N ` `=` `len` `(arr) ` `print` `(findMinDif(arr, N)) ` ` ` `# This code is contributed by yatinagg ` |

*chevron_right*

*filter_none*

## C#

`// C# Program to split a given array ` `// such that the difference between ` `// their maximums is minimized. ` `using` `System; ` `class` `GFG{ ` ` ` `static` `int` `findMinDif(` `int` `[]arr, ` `int` `N) ` `{ ` ` ` ` ` `// Sort the array ` ` ` `Array.Sort(arr); ` ` ` ` ` `// Return the difference between ` ` ` `// two highest elements ` ` ` `return` `(arr[N - 1] - arr[N - 2]); ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `[]arr = { 7, 9, 5, 10 }; ` ` ` `int` `N = arr.Length; ` ` ` ` ` `Console.Write(findMinDif(arr, N)); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

**Output:**

1

**Time complexity: ** O(N*log(N)), N is the number of elements of the array.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Split a given array into K subarrays minimizing the difference between their maximum and minimum
- Split array to three subarrays such that sum of first and third subarray is equal and maximum
- Min difference between maximum and minimum element in all Y size subarrays
- Count all subarrays whose sum can be split as difference of squares of two Integers
- Split an array into two equal Sum subarrays
- Split array in three equal sum subarrays
- Split array into K disjoint subarrays such that sum of each subarray is odd.
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Minimum difference between maximum and minimum value of Array with given Operations
- Minimize the maximum minimum difference after one removal from array
- Minimize difference between maximum and minimum of Array by at most K replacements
- Minimum and Maximum of all subarrays of size K using Map
- Number of subarrays whose minimum and maximum are same
- Minimum value of maximum absolute difference of all adjacent pairs in an Array
- Minimize the difference between the maximum and minimum values of the modified array
- Choose k array elements such that difference of maximum and minimum is minimized
- Sum of minimum and maximum elements of all subarrays of size k.
- Sum of all differences between Maximum and Minimum of increasing Subarrays
- Missing occurrences of a number in an array such that maximum absolute difference of adjacent elements is minimum
- Minimum absolute difference of XOR values of two subarrays

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.