This project is a C++ implementation of a skip list — a probabilistic data structure that keeps elements sorted and supports fast search and insertion on average.
insert()andsearch()operations- Copy and move constructors / assignment
- Text file loading and saving
- Binary file loading and saving
- Console display for debugging
- Simple benchmark against
std::multiset
Requires CMake and a C++20 compiler.
cmake -S . -B build
cmake --build build./build/Projectmain.cpp— demo, file I/O, and benchmarkSkiplist.h— skip list implementationCMakeLists.txt— build configuration
Generated folders such as cmake-build-debug/, html/, and latex/ are intentionally excluded from the public copy.