David, not only is the fuzzy hash O(n) (with low constant) for lookup,
it is also O(n) for insert, requiring insertion onto two separate
ordered lists...
No it isn't, for the insert case you have to find the neighbours
anyways so the cost of a lookup is what you eat and this is an
unavoidable overhead no matter what algorithm you use.
Later,
David S. Miller
davem@dm.cobaltmicro.com
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/faq.html