Meghraj

 Profile Answers by Meghraj 

• Jun 14th, 2014

 

well check for how many 1s,2s, upto 9s in both the arrays and minimum of a particular digit(from 1 to 9) in an array will be the common numbers of that particular digit. we will check upto 9 in both arrays for total common numbers.

jbode

 Profile Answers by jbode Questions by jbode

• Jun 19th, 2014

 

Assuming both arrays are sorted in ascending order, this is pretty easy to do in a single loop with two array counters. Start both counters at zero. Compare array elements at their respective counters ( a1[s1] == a2[s2] ). If they match, write the matched value to the result array, then advance both array counters until they both point to a new value (that way you dont match mulutpie occurences). If they dont match, advance the counter in the array with the lower value. Repeat until you reach the end of either array.

Code
#include <stdio.h>


#include <stdlib.h>


#include <string.h>


#include <math.h>


#include <time.h>


 


/**


  * callback function for qsort


  *//**


 * Display array contents to specified file stream


 */"""%s = {""%s%d", sep, arr[i] );


    sep = ",""}\n" );


}


 


/**


 * Generate a sorted array with a random size no less than minsize and


 * and random contents between 1 and 10.  


 *//**


 * Find matching values in the two arrays.


 *//**


 * Test driver.


 */"allocation failure\n"" a1"" a2""allocation failure\n""res"

Sagar Ys

 Profile Answers by Sagar Ys 

• Aug 13th, 2015

 

Sort both the arrays, remove duplicate in both the arrays.
Combine two arrays sort it and find the duplicate.

Nitin Garg

• Dec 12th, 2015

 

Code
#include<stdio.h>


#include<conio.h>


#include<math.h>


"%d "//if


             


}//for


k++;


 


}//while


 


 


getch();


}

Alejandro Visiedo

• Mar 5th, 2016

 

Code
span style="color: #ff0000;">"%d, "