Efficient search of sorted numerical values

Question

I have an int[] array that contains values with the following properties:

• They are sorted
• They are unique (

Answer 1

If int[] is

• sorted
• have unique values
• you know the range (in advance)

Than instead of searching why not to save the value at its index.

Say the number is 243 than save the value in int[243] = 243.

That way searching will be easy and faster. Only thing left is to find out next higher value.