For all practical purposes you cannot rely on the hash elements to be stored in any particular order. It depends on how many elements the hash has, on the value of the keys, and in recent Perl versions can be additionally randomized to prevent certain types of attacks.

The order of the elements as returned by the keys, each and values functions is not the order of insertion or follows the alphabet. The order produced by these three functions is however internally consistent (meaning you can iterate over keys and values separately and they will match).

You can sort the keys (for example) alphabetically if you need to do this, but you cannot recover the order of insertion.

This may seem inconvenient, but it is (a fundamental) part of how a hash works. It is not made to retrieve elements in a certain order, but it is very fast at single-element lookups. Testing if an element exists is for example much more efficient in a hash than in an array.