Fast Range Detection Algorithm
I have an Array of 8 elements: `Bin[8]`. 
Bin represents a range container: I receive a number `N`, such as `0 <= N <= 255`.

 1. If `N < 32` ==> `Bin[0] += 1`
 2. Else If `32 <= N < 64` ==> `Bin[1] += 1`
 3. ... etc.

I want a fast solution that does not require an `If-Else` directive, as I have multiple Bins to handle.

I am using Java, but a solution in any programming language is accepted.

Thank you.
Fast Range Detection Algorithm
===

I have an Array of 8 elements: `Bin[8]`. 
Bin represents a range container: I receive a number `N`, such as `0 <= N <= 255`.

 1. If `N < 32` ==> `Bin[0] += 1`
 2. Else If `32 <= N < 64` ==> `Bin[1] += 1`
 3. ... etc.

I want a fast solution that does not require an `If-Else` directive, as I have multiple Bins to handle.

I am using Java, but a solution in any programming language is accepted.

Thank you.