Orchard Notes
Very fast.
- Appears O(log n) average time per search, but there is no proof of this performance.
Requires too much memory.
- Requires O(n2) memory for the sorted lists.
- Modification for large n. Just store the first m closest to make an n x m array. If the search runs off the array then revert to linear search.