The Ullman set is a clever data structure for a set of n integers densely distributed over a range, say from 0 to N-1. It uses O(N) space, and supports construction, destruction, adding, deleting, membership-test as well as cardinality operations in O(1) time. Moreover iterating over its members only takes O(n) time.
skip to main |
skip to sidebar
My study of machine learning, data mining, computational linguistics and information retrieval, towards the grand goal of developing the "perfect search engine" that "understands exactly what you mean and gives you back exactly what you want" (Larry Page).
Posts
No comments:
Post a Comment