Question 16th: the shortest distance between the two arrays.

[Plain]
/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Completion date: January 1, April 24, 2013
* Version No.: V1.0
*/
 
# Include <stdio. h>
# Include <stdlib. h>
 
Int main ()
{
Int I;
Int j;
Int k = 0;
Int min;
Int sum [20]; // 4*5 = 20 difference values
Int num [] = {1, 3, 5, 7, 9}; // num [] instead of x []
Int cou [] = {2, 4, 6, 8}; // cou [] instead of y []
 
For (I = 0; I <4; I ++)
{
For (j = 0; j <5; j ++)
{
Sum [k ++] = abs (cou [I]-num [j]); // calculates the absolute value difference
}
}

Min = sum [0];
 
For (I = 0; I <k; I ++)
{
If (sum [I] <min)
{
Min = sum [I];
}
}

Printf ("Minimum Absolute Value Difference Between the array num [] and the array cou [] is % d \ n", min );
 
Return 0;
}

/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Completion date: January 1, April 24, 2013
* Version No.: V1.0
*/

# Include <stdio. h>
# Include <stdlib. h>

Int main ()
{
Int I;
Int j;
Int k = 0;
Int min;
Int sum [20]; // 4*5 = 20 difference values
Int num [] = {1, 3, 5, 7, 9}; // num [] instead of x []
Int cou [] = {2, 4, 6, 8}; // cou [] instead of y []

For (I = 0; I <4; I ++)
{
For (j = 0; j <5; j ++)
{
Sum [k ++] = abs (cou [I]-num [j]); // calculates the absolute value difference
}
}

Min = sum [0];

For (I = 0; I <k; I ++)
{
If (sum [I] <min)
{
Min = sum [I];
}
}

Printf ("Minimum Absolute Value Difference Between the array num [] and the array cou [] is % d \ n", min );

Return 0;
}