>The beauty of this is that it can be implemented, >not only with a array, but an ordered list or >cursor.

Walter,

I won't get into a discussion about which method is, from a standpoint of computational complexity, is best. However, you're exactly right about the fact that it can be implemented with any ordered object. This includes both an array (which I chose for the sake of simplicity), ordered list or cursor. In fact, the performance with a cursor, probably yields the best results because of the IO.