The fastest way to find if an int array contains a number

Question

This is a strange question. I have an integer array in Java where each int represents a color. They will be either 0xFFFFFFFF or 0x0. What would be the fastest way to find if this array contains ANY values ​​equal to 0xFFFFFFFF?

This is my current code:

int length = w * h;
for (int i = 0; i < length; i++) {
    if (pixels[i] == 0xFFFFFFFF) {
        return true;
    }
}

I have no clue if there is a faster way to do this or not. I suggest that you vets might get a trick or two though.

EDIT: Seeing that this is just a dumb array of pixels from Bitmap.getPixels (), it will not sort or convert to another storage structure. Thanks for the contribution, everyone seems to have scrolling the best way in this case.

Answer 1

, , , , .

"O (n)". , , , , .

Answer 2

- , , . , , , - , .

, . , :

• , , , , . , , . , , , , . , O (1), , .

• , - (, ), . , , , , , , , , - , "" .

• , ( ), , . , , .

• , , - , , , (, ), , . , , . , , - - , .

• , - , -, O (1) , . , .

• , - - , . (, , ) .

• , , , , - . , , , . . , , , (, O (log n)) . , .

• , , bitvector. (, 32-128x). , - 0, , - . , , .

, !

Answer 3

-,

if (pixels[i] != 0)

, , , , .

Answer 4

, , . , (, t , t - ). parallelism .

Answer 5

, : . (templatetypedef .) 25% :

tmp = a[n - 1]
a[n - 1] = 0xFFFFFFFF

pos = 0
while a[pos] != 0xFFFFFFFF
    pos = pos + 1

a[n - 1] = tmp

if a[pos] = 0xFFFFFFFF then
    return pos
return -1

# .

Answer 6

- . , , .

int length = w * h;
for (int i = 0; i < length; i++) {
    if (pixels[i] & 0xFFFFFFFF) {
        return true;
    }
}

Answer 7

, ? , , 0xFFFFFFFF. , "" , : D

, O (n), , ( , ) .

Answer 8

foreach, , , id

for(int pix:pixels){
    if(pix!=0)
        return true;
}

Answer 9

Arrays.asList(...).contains(...)