Fastest way to search the table ( or array )

This is a discussion on Fastest way to search the table ( or array ) within the C++ Programming forums, part of the General Programming Boards category; Hi,
I got one, two dimensional array.
MyArray[1000][2].
Both the array i.e.
MyArray[0][0]........
MyArray[0][1].......
are filled with some values.
We ...

Now with each element in the array:
MyArray[0][0]......MyArray[0][1000] will be checked, whether it is falling with minimum_v_0
and maximum_v_0
AND
MyArray[1][0]......MyArray[1][1000] will be checked, whether it is falling with minimum_v_1
and maximum_v_1.

Means,
If both the column elements in a particular row will have values between corresponding
minimum and maximum value for that column then that row will be selected.

Make sure here both the column values must fall within corresponding range.

Please help me to do the fastest method for reaching to the value. We may require to arrange the
existing data in some structured form and develop the search algorithm.

whats teh type fo th values in the array, there may be some optimizations that coudl speed things up, but wihtout knowing if they are bytes or doubles or somethign else I can't help that much. I would suggest multithreaded search and reduction, but with such small arrays the system overhead fo starting several threads would eat any gains in performance.

Until you can build a working general purpose reprogrammable computer out of basic components from radio shack, you are not fit to call yourself a programmer in my presence. This is cwhizard, signing off.