Los puntos clave no están disponibles para este artículo en este momento.
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.
Fredman et al. (Tue,) studied this question.