Skiplists and Quicksort in C++

I recently completed my C++ implementation of a skiplist data structure. Although it lacks many features of a more robust class (i.e. a copy constructor, overloaded operators), changing my implementation into a truly abstract data type would be trivial (just change the search function). As it is, it admirably fulfills the requirements of the assignment.

And if you were looking for both iterative and recursive implementations of the famous quicksort algorithm, look no further. It uses lists from the standard template library.

← Previously: Four Blogs | All posts | Next: Humdrum →