Question

i have two integer array, each size 95700.i want compare to two integer arrays,i got maximum size of integer using Integer.MAX_VALUE(2147483647).

i used following code,

for(int i=0;i<array1.length;i++) {
    if (array1[i] == 0xFF0000FF && array2[i] == 0xFFFFFFFF) {
        matched++;              
    } else {
        unMatched++;
    }
}

this code taking lot of time(50s). How to decreases comparison time…please help me

EDIT:
this is my logcat:

12-22 15:20:29.638: INFO/System.out(1660): start time-----18041173568804 
12-22 15:20:29.638: INFO/System.out(1660): time-----40981116222 
12-22 15:20:29.688: INFO/System.out(1660): The array comparison toook an average of 40.981116 second

Answer 1

You need to provide more detail because there is no way the array comparison is taking 50 seconds, or even 50 milli-seconds as described

public static void main(String... args) {
    int[] array1 = new int[95700];
    int[] array2 = new int[95700];
    for (int j = 0; j < array1.length; j += 3) {
        array1[j] = 0xFF0000FF;
        array2[j] = 0xFFFFFFFF;
    }
    long start = System.nanoTime();
    int runs = 10000;
    int matched = 0, unMatched = 0;
    for (int r = 0; r < runs; r++) {
        matched = unMatched = 0;
        for (int i = 0; i < array1.length; i++) {
            if (array1[i] == 0xFF0000FF && array2[i] == 0xFFFFFFFF) {
                matched++;
            } else {
                unMatched++;
            }
        }
    }
    long time = System.nanoTime() - start;
    System.out.printf("The array comparison to an average of %.6f second, matched=%,d, unmatched=%,d%n",
            time / 1e9 / runs, matched, unMatched);
}

prints

The array comparison to an average of 0.000109 second, matched=31,900, unmatched=63,800

That is one tenth of one milli-second.