October 1st, 2012, 09:17 AM
How to do write this method with more efficiency ?
The program below accept two array with hole pozitive nums, with same size N, and fill empty array "c" with nums of "a" that do not exist in "b" and return the biggest num of "a" that do not exist in "b".
qustion: how to do write this method with more efficiency ?
public int f(inta, intb, int c)
int N = a.length;
int j, max = 0, g = 0, t = 0;
for(int i=0; i < N; i++)
for(j=0; j<N; j++)
if(b[j] == a[i]) // if find the num in "b" go to the next num in "a"
if(j == N)
c[t] =a[i] // fill empty array "c" with nums of "a" that do not exist in "b"
if(g ==0 || c[t] > max)
max = c[t]; // remmber the max num in "max"
g = 1;
return max; // max of "a" that you do not have in "b"
October 2nd, 2012, 02:55 PM
If the are guaranteed to be the same size then
Store the size of a or b in an int.
Hold a seperate counter variable that increments one at a time.
Hold a seperate variable for the current max number.
Loop through the specified number of times (which == the size of array a).
If elementA(count) != elementB(count)
// add to array list c
// set the new max number to be this number
// Now we're at the end of the loop.
// Print out the max number
October 3rd, 2012, 04:09 AM
That only checks if 'a' and 'b' contain the same elements in the same position in the array, which isn't the original problem.
Originally Posted by doa24uk
Hint to OP: this is much more efficient of 'a' and 'b' are sorted.
October 6th, 2012, 06:31 AM
Doh! Of course, you are correct.
Originally Posted by ishnid