Michael J. Gubody Electrical Engineering major
PAPER Gubody, M.J., & Lee, T-C. (2011, March). C++ skip-list optimizated implementation. Paper presented at the annual meeting of the Michigan Academy of Science, Arts, and Letters, Saginaw Valley State University, University Center, MI. In this paper, we study the data structure of a skip-list. A skip-list is a container structure similar to a typical list container, although benefiting in search and insert operations due to being inherently sorted and a nearly binary-search optimization. An implementation is being developed that allows elements to retain both an unsorted push-back insertion and the faster search and insert benefits, while providing a C++ standard library container interface. The project will provide a library consisting of several implementations of skip-lists. These implementations will vary, consisting of static or maximum variable skip-list height, unique or non-unique element containment, and the unsorted or sorted internal ordering. Iterators for the implementations will also be provided, in keeping with the std lib container interface.
Research Bulletin 2011
295