|
1 year ago | |
---|---|---|
.idea | 1 year ago | |
.clang-tidy | 1 year ago | |
.gitignore | 1 year ago | |
CMakeLists.txt | 1 year ago | |
README.md | 1 year ago | |
main.cpp | 1 year ago | |
output.txt | 1 year ago | |
simplecompile.sh | 1 year ago | |
skiplist.cpp | 1 year ago | |
skiplist.h | 1 year ago |
Goals: Working with dynamic arrays, pointers, doubly linked lists
For this assignment, you will write a Skip List data structure to store integers.
When searching a Skip List, items can be found in O(log n) time. No duplicates are allowed.A SkipList can have multiple levels. SkipList of depth 1 is similar to a doubly linked list. All elements are inserted into a single doubly linked list.
When a SkipList has multiple levels, all elements are inserted at level = 0. 50% of those inserted at level = 0, are also inserted at level = 1. 50% of those inserted at level = 1 are also inserted at level = 2, and so on.
./simplecompile.sh
These options are defined in .clang-tidy
file.
Perform all check except the following:
-fuchsia-* do not need specific checks for “fuchsia” a modular, capability-based operating system
using namespace std;
{
{
This option is not available in CSS Linux lab under LLVM 3.8.1, but is needed on my PC when using 9.0.0auto func() -> int
format{
(this optionusing namespace std;
This file is part of a repository located at https://github.com/pisan342/ass3-maze-starter