Python Program to Find closest number in array

Python Program for Find the closest pair from two sorted arrays

Last Updated : 21 Apr, 2025

Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each array.
We are given two arrays ar1[0...m-1] and ar2[0..n-1] and a number x, we need to find the pair ar1[i] + ar2[j] such that absolute value of (ar1[i] + ar2[j] - x) is minimum.
Example:

Input:  ar1[] = {1, 4, 5, 7};
        ar2[] = {10, 20, 30, 40};
        x = 32      
Output:  1 and 30

Input:  ar1[] = {1, 4, 5, 7};
        ar2[] = {10, 20, 30, 40};
        x = 50      
Output:  7 and 40

Python3

# Python3 program to find the pair from
# two sorted arrays such that the sum 
# of pair is closest to a given number x
import sys

# ar1[0..m-1] and ar2[0..n-1] are two 
# given sorted arrays and x is given 
# number. This function prints the pair 
# from both arrays such that the sum 
# of the pair is closest to x.
def printClosest(ar1, ar2, m, n, x):

    # Initialize the diff between 
    # pair sum and x.
    diff = sys.maxsize

    # res_l and res_r are result 
    # indexes from ar1[] and ar2[]
    # respectively. Start from left
    # side of ar1[] and right side of ar2[]
    l = 0
    r = n-1
    while(l < m and r >= 0):
    
    # If this pair is closer to x than 
    # the previously found closest,
    # then update res_l, res_r and diff
        if abs(ar1[l] + ar2[r] - x) < diff:
            res_l = l
            res_r = r
            diff = abs(ar1[l] + ar2[r] - x)
    

    # If sum of this pair is more than x,
    # move to smaller side
        if ar1[l] + ar2[r] > x:
            r = r-1
        else: # move to the greater side
            l = l + 1
    

    # Print the result
    print("The closest pair is [",
         ar1[res_l], ", ", ar2[res_r], "]")

# Driver program to test above functions
ar1 = [1, 4, 5, 7]
ar2 = [10, 20, 30, 40]
m = len(ar1)
n = len(ar2)
x = 38
printClosest(ar1, ar2, m, n, x)

# This code is contributed by Smitha Dinesh Semwal

Output:

The closest pair is [ 7 ,  30 ]

Time Complexity : O(n)
Auxiliary Space : O(1)

Please refer complete article on Find the closest pair from two sorted arrays for more details!

Python Program to Find closest number in array

kartik

Improve

Article Tags :

Practice Tags :

python

Similar Reads

Python Program to Find closest number in array

Given an array of sorted integers. We need to find the closest value to the given number. Array may contain duplicate values and negative numbers. Examples: Input : arr[] = {1, 2, 4, 5, 6, 6, 8, 9} Target number = 11 Output : 9 9 is closest to 11 in given array Input :arr[] = {2, 5, 6, 7, 8, 8, 9};

Python Program to Print uncommon elements from two sorted arrays

Given two sorted arrays of distinct elements, we need to print those elements from both arrays that are not common. The output should be printed in sorted order. Examples : Input : arr1[] = {10, 20, 30} arr2[] = {20, 25, 30, 40, 50} Output : 10 25 40 50 We do not print 20 and 30 as these elements ar

Python3 Program for Find k pairs with smallest sums in two arrays

Given two integer arrays arr1[] and arr2[] sorted in ascending order and an integer k. Find k pairs with smallest sums such that one element of a pair belongs to arr1[] and other element belongs to arr2[]Examples: Input : arr1[] = {1, 7, 11} arr2[] = {2, 4, 6} k = 3Output : [1, 2], [1, 4], [1, 6]Exp

Python Program to Find a pair with the given difference

Given an unsorted array and a number n, find if there exists a pair of elements in the array whose difference is n. Examples: Input: arr[] = {5, 20, 3, 2, 50, 80}, n = 78 Output: Pair Found: (2, 80) Input: arr[] = {90, 70, 20, 80, 50}, n = 45 Output: No Such Pair Recommended: Please solve it on "PRA

Python3 Program to Find lost element from a duplicated array

Given two arrays that are duplicates of each other except one element, that is one element from one of the array is missing, we need to find that missing element.Examples: Input: arr1[] = {1, 4, 5, 7, 9} arr2[] = {4, 5, 7, 9}Output: 11 is missing from second array.Input: arr1[] = {2, 3, 4, 5} arr2[]

Python Program to find the Next Nearest element in a Matrix

Given a matrix, a set of coordinates and an element, the task is to write a python program that can get the coordinates of the elements next occurrence. Input : test_list = [[4, 3, 1, 2, 3], [7, 5, 3, 6, 3], [8, 5, 3, 5, 3], [1, 2, 3, 4, 6]], i, j = 1, 3, K = 3 Output : (1, 4) Explanation : After (1

Python - Find the closest date from a List

Given a date and list of dates, the task is to write a python program to find the nearest date in the given input list of dates to the input date. Examples: Input : test_date_list = [datetime(2020, 4, 8), datetime(2016, 8, 18), datetime(2018, 9, 24), datetime(2019, 6, 10), datetime(2021, 8, 10)], te

Python program to find the Strongest Neighbour

Letâ€™s solve a common problem where we find the strongest neighbour in a list of numbers. By "strongest neighbour," we mean the maximum of every two adjacent numbers in the list. For instance, if we have [1, 2, 3, 4], the strongest neighbours would be [2, 3, 4]. This is because 2 is the maximum of 1

Find K Closest Points to the Origin

Given an array of points where each point is represented as points[i] = [xi, yi] on the X-Y plane and an integer k. The task is to find k closest points to the origin(0,0) in any order.Note: The distance between two points on a plane is the Euclidean distance.Examples: Input: k = 3, points = [[1, 3]

Python3 Program for Two Pointers Technique

Two pointers is really an easy and effective technique which is typically used for searching pairs in a sorted array.Given a sorted array A (sorted in ascending order), having N integers, find if there exists any pair of elements (A[i], A[j]) such that their sum is equal to X.Letâ€™s see the naive sol