Proximity Map Search

Created: 2023-07-11T09:03:29-05:00

Return to the Index

Using the data structures created by proximity sorting, find an element within that container in O(1) time.

Hash the key being searched to find Bucket
Look up ProxMap[Bucket] to see if the bucket even exists
If it exists, ProxMap[Bucket] points at the neighborhood where the value is
Scan the neighborhood for the desired value

Proximity Sorting