Alexander Klenin schrieb: > The best Succ(X) algorithm I can think of that works correctly on > sparse enums is O(log enum_size). It depends how much memory one wastes ;)