In this proof for the rationals being countably infinite, is the enumeration strategy important? 
During some set theory exercises I came across the proof that the rationals are countably infinite. It used what appears to be a common proof where all the pairs are listed and a zig-zagging path is taking through them, starting with $(1,1), (1,2), (2,1)...$ and so forth.  
Of course I am tasked with proving all kinds of related things and my first snag is the following: Is the path taken, or maybe better put, is the enumeration strategy important?
I'm guessing it is, if you would just list all pairs $\sum_{i=1} (1,i)$ first, you would never reach $(2,1), (2,2)...(3,1)...$ and such. From a computational perspective, this makes sense to me. Intuitively, not so much, since we are already dealing with infinites.
But the way my textbook does it, you have a diagonal of pairs, starting with $(1,1)$ that grows and as such all the rows get even "exposure". Is this reasoning correct?
Note, my textbook doesn't count 0 as a natural number.

The specific enumeration isn't important - there are lots of others that would work equally well and have all the same properties as far as the set theory is concerned. What is important is that the enumeration given hits each rational at some finite stage. The enumeration you suggest only enumerates (2, 1) after infinitely many rationals have already been enumerated.
But you could easily use a "backwards" enumeration that does (1,2) before (2,1), or one that goes back to (3, 1) after (1, 2).
