what's your method for quickly searching an ordered list? Binary search falls apart since you don't have free random access.
In Lisp, most people would just, you know, not use a list for that. You can do that, you know...
The only reason I asked about lispers is that lispers really like lisps, and I was curious if any of them had implemented skip lists for some reason, and if so, how.
Yes, I know. Do you? You made the suggestion that skip lists are inferior to ordered lists, not me. (good for "increasing access times on ordered lists") I'm still perplexed as to your rationale for that statement.
I am actually a native speaker, so I have no excuse here. I just suck at writing, I guess...