48 lines
1.2 KiB
C
48 lines
1.2 KiB
C
|
/*
|
||
|
|
* C Program to Find the two Elements such that their Sum is Closest to Zero
|
||
|
|
*/
|
||
|
|
# include <stdio.h>
|
||
|
|
# include <stdlib.h>
|
||
|
|
# include <math.h>
|
||
|
|
|
||
|
|
void minabsvaluepair(int array[], int array_size)
|
||
|
|
{
|
||
|
|
int count = 0;
|
||
|
|
int l, r, min_sum, sum, min_l, min_r;
|
||
|
|
/* Array should have at least two elements*/
|
||
|
|
if (array_size < 2)
|
||
|
|
{
|
||
|
|
printf("Invalid Input");
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
/* Initialization of values */
|
||
|
|
min_l = 0;
|
||
|
|
min_r = 1;
|
||
|
|
min_sum = array[0] + array[1];
|
||
|
|
for (l = 0; l < array_size - 1; l++)
|
||
|
|
{
|
||
|
|
for (r = l + 1; r < array_size; r++)
|
||
|
|
{
|
||
|
|
sum = array[l] + array[r];
|
||
|
|
if (abs(min_sum) > abs(sum))
|
||
|
|
{
|
||
|
|
min_sum = sum;
|
||
|
|
min_l = l;
|
||
|
|
min_r = r;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
printf(" The two elements whose sum is minimum are %d and %d", array[min_l], array[min_r]);
|
||
|
|
}
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int array[] = {42, 15, -25, 30, -10, 35};
|
||
|
|
minabsvaluepair(array, 6);
|
||
|
|
getchar();
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
|
||
|
|
The two elements whose sum is minimum are 15 and -10
|