An Algorithim required for this-->

[pravish]

Hey there
consider this..... I have a very large array(2d) that stores integer values ranging from
0-360. i wish to find out those memory locations that contain values ranging from 50-100. Since the array is very large i do not wish to carry out a sequential execution.
There r many locations that have values in the given range, but the number of such locations are relatively less as compared to the array size.
Can anybody suggest me some algorithm to find these memory locations with out checking the array sequentially. Is it illogical???
Thanks
regards

Added after 13 minutes:

and yes ...i do not want to for a searching algo cause i ll be accessing the array just once....kindly suggest something

 

[hr_rezaee]

hi
I think there is no way for you.
regards

 

[cherrytart]

If you don't check every element of the array, how can you be sure you haven't missed a value?

The only alternative I can see is to check the ranges when the array items are entered.

Which may be a failure of my imagination.

In days of yore, some DMA controllers could generate exceptions on pattern matches, but this only puts the sequential search into hardware.