The punch-line is that there are more real numbers between 0 and 1 than there are whole numbers greater than 0. The proof basically shows that even if you imagine that you had a countably-infinitely-long list of all the real numbers between 0 and 1, you can construct a number that must be missing from the list -- which is a contradiction, and thus no such list can exist (implying that there are more numbers between 0 and 1 than numbers greater than 0).
For instance, your enumeration is missing every irrational (or even recurring decimal) number. That set of numbers is uncountably infinite.
[1]: https://en.wikipedia.org/wiki/Cantor's_diagonal_argument
So, there is no list of all the real numbers between 0 and 1, but you are claiming there are uncountably infinite of them?
Numberphile did a pretty good introductory video to this if you want to learn more: https://www.youtube.com/watch?v=elvOZm0d4H0.
Most reals don't have a generating algorithm, since there is an uncountable number of reals, but only a countable number of algorithms. (Assuming an algorithm has to be a finite length program.)
0.5 in base 10 is the same as 0.1 in base 2, which is the same as 0.11111... in base 3. And the choice of base is completely arbitrary, with some societies using others, like base 12 or base 60.
To see why you cannot generate every possible real number as a list, look up cantors diagonal argument.
The issue being that there are way to many "real numbers".
There is a simple algorithm for generating every possible decimal number:
In binary, it's even simpler; you just generate every permutation of bits.