in reply to Re^5: What makes an array sorted and a hash unsorted?
in thread What makes an array sorted and a hash unsorted?

You appear to be conflating being ordered with being sorted and searching with simple access.
I'm just following the terminology set down by the OP. Let me recall the name of the topic: What makes an array sorted and a hash unsorted?

Surely you don't suggest that ikegami thinks all arrays are sorted the way you describe sorted?

  • Comment on Re^6: What makes an array sorted and a hash unsorted?

Replies are listed 'Best First'.
Re^7: What makes an array sorted and a hash unsorted?
by herveus (Prior) on Jun 03, 2009 at 14:16 UTC
    Howdy!

    The properties of being sorted and being ordered are very different things. Well, being sorted requires being ordered, but not the other way around.

    The topic makes an incorrect assertion right up front, and a number of respondents have noted that. Insisting on sticking with demonstrably incorrect usage is kind of silly.

    My response was specifically to the words you wrote. I'm not trying to read ikegami's mind here.

    Was my explanation confusing or unclear?

    yours,
    Michael
[reply]

In Section Meditations