How many unique values are there between 0 and 1 of a standard float?

I wrote this very silly program, and it gives the answer 1065353217, which is indeed just shy of 2³⁰ (1073741824). Subtract 2 from that number if you were looking for all the numbers not including 0 and 1. By the way, the smallest non-zero number appears to be 1.401298E-45.

class Program
{
    public unsafe static int Search()
    {
        int i = 0;
        float* f = (float*)&i;
        while (*f >= 0 && *f <= 1)
        {
            f = (float*)&i;
            i++;
        }

        return i;
    }

    static void Main(string[] args)
    {
        Console.WriteLine(Search());
        Console.ReadLine();
    }
}

It's 7 significant digits, that is, when writing it in exponential notation you ignore the exponent.

0.0000000000000000001234567 has the same number of significant digits as 12345670000000000000, just with a different exponent. That's the magic that allows floating-point numbers to store really small and really large numbers.

As for exactly how many possible numbers there are for a float in (0, 1) I cannot say exactly right now. You have a 23-bit mantissa, so 2²³ possible states of it. Then there is an 8-bit exponent and if I'm not terribly mistaken about half of its possible values will result in a number between 0 and 1. Which should leave you with about 2^{23 + 7} = 2³⁰ possible values in that range. If anything that's perhaps an upper bound and not the exact value. I would need to consult documentation about the finer details to know exactly (and probably rethink the math above which might miss a few points).

Positive floating-point values are ordered the same as their encodings. 0.0f is 0x00000000. 1.0f is 0x3f800000. So there are 0x3f800000 - 1 floating point values that lie strictly in between, or 1,065,353,215.

If you want to include the endpoints in your count, keep in mind that there are two encodings of zero.

Keep in mind, too, that floating-point values are not uniformly spaced. The difference between 1.0f and the next smaller number is 2**-24, whereas the difference between 0.0f and the next larger number is 2**-149. If you want to increment a float from 0 to 1 with uniform steps, the smallest step size you can use is 2**-24.

How many unique values are there between 0 and 1 of a standard float?

This is not really the question you want an answer for, but the answer is, not including 0 and 1 themselves, that there are 2**23 - 1 subnormal numbers and 126 * 2**23 normal numbers in this range, for a total of 127 * 2**23 - 1, or 1,065,353,215.

But note that these numbers are not evenly distributed on the interval between 0 and 1. Using a "delta" of 1f / 1065353215f in a loop from 0f to 1f will not work for you.

If you want to step from 0.0 to 1.0 with eqally long steps of the (decimal) form 0.00...01, maybe you should use decimal instead of float. It will represent numbers like that exactly.

If you stick to float, try with 0.000001 (ten times greater than your proposed value), but note that errors can build up when performing very many additions with a non-representable number.

Also note: There are a few "domains" where you can't even count on the first seven significant decimal digits of a float. Try for example saving the value 0.000986f or 0.000987f to a float variable (be sure the optimization doesn't hold the value in a "wider" storage location) and write out that variable. The first seven digits are not identical to 0.0009860000 resp. 0.0009870000. Again you can use decimal if you want to work with numbers whose decimal expansions are "short".

Edit: If you can use a "binary" step for your loop, try with:

float delta = (float)Math.Pow(2, -24);

or equivalently as a literal:

const float delta = 5.96046448e-8f;

The good thing about this delta is that all values you encouter through the loop are exactly representable in your float. Just before (under) 1f, you will be taking the shortest possible steps possible for that magnitude.