Hash Array

Hash Sort based data array structure, assume all removals and inserts are cached into separate (optionally sorted) array O(1), assume size(array) is much greater than size(cache), so O(1) assumption holds for any algorithm. If data has different distribution function, just use that instead as the hash-function, instead of the linear-uniform distribution function.