Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Python Program for Find the closest pair from two sorted arrays
In this article, we will learn about the solution to the problem statement given below.
Problem statement − We are given two arrays, we need to find the closest pair from the two sorted arrays
Now let’s observe the solution in the implementation below −
Example
# sys module
import sys
# pair
def print_(ar1, ar2, m, n, x):
# difference
diff=sys.maxsize
# index
l = 0
r = n-1
while(l < m and r >= 0):
# closest pair
if abs(ar1[l] + ar2[r] - x) < diff:
res_l = l
res_r = r
diff = abs(ar1[l] + ar2[r] - x)
# pair sum
if ar1[l] + ar2[r] > x:
r=r-1
else:
l=l+1
# Print the result
print("The closest pair available is [",ar1[res_l],",",ar2[res_r],"]")
# main
ar1 = [1, 3, 6, 9]
ar2 = [11, 23, 35, 50]
m = len(ar1)
n = len(ar2)
x = 20
print_(ar1, ar2, m, n, x)Output
The closest pair available is [ 9 , 11 ]
All the variables are declared in the local scope and their references are seen in the figure above.
Conclusion
In this article, we have learned about how we can make a Python Program for Find the closest pair from two sorted arrays
Updated on: 20-Dec-2019
128 Views
Advertisements