The answer you expect depends on the design of the tables: If the table is a
heap (without clustered index) and no non-clustered indexes are present,
there's no way to be sure that the result will be always in the same order,
because of the way SQL gets the result: it should be a table scan, and this
means that SQL gets the pages belonging to the table.
Again, if the table is a heap but there's is some non clustered index and
the optimizer will use it, each time the same non clustered index wil be used
the order of the result set will be the same.
Finally, if the table have a clustered index, the result set will be always
in the same order (USING the QUERIES YOU SHOW AS SAMPLE). The clustered index
is a B-Tree structure in which the leaf level IS the data page, and
determines the phisical order of the rows.