Why does L[::-1] reverse the order of L ?
I thought the default start index was zero so doesn't list L **start** at its first entry?

**start** at its first entry?

From docs.python.org

The slice of s from i to j with step k is defined as the sequence of items with index x = i + n

k such that 0 <= n < (j-i)/k. In other words, the indices are i, i+k, i+2k, i+3*k and so on, stopping when j is reached (but never including j). When k is positive, i and j are reduced to len(s) if they are greater. When k is negative, i and j are reduced to len(s) - 1 if they are greater.If i or j are omitted or None, they become “end” values (which end depends on the sign of k).Note, k cannot be zero. If k is None, it is treated like 1.

there is only one logical way to traverse a list one step backwards each time, from the end

Sorry if I wasn't clear, but my question essentially is why does the resulting "backward' listing start with the last item since the first colon says to start at index zero, which is the first entry of the list ?!?

I realize the "-1" instructs the list to step backwards but why is it STARTING at the last entry?

Thanks for the reply, but so far nobody has addressed this point.

**ONLY when k is not negative**", but you and Conrad made that clear.
Thanks again,
Dan