Skip to content

GH-147: Skiplist in C++ #148

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 17 commits into from
Feb 8, 2023
Merged

GH-147: Skiplist in C++ #148

Changes from 1 commit
Commits
Show all changes
17 commits
Select commit Hold shift + click to select a range
905f92e
update
rain1024 Feb 3, 2023
2282d1b
update
rain1024 Feb 3, 2023
f3ab5f8
update
rain1024 Feb 3, 2023
b3b0706
update
rain1024 Feb 3, 2023
af4864a
update
rain1024 Feb 6, 2023
5a90a12
GH-125: Release version 1.1.0
rain1024 Feb 6, 2023
2ac2a02
update
rain1024 Feb 8, 2023
8e58d02
update
rain1024 Feb 8, 2023
ac6401c
update
rain1024 Feb 8, 2023
1a22724
update
rain1024 Feb 8, 2023
779fb73
Merge branch 'GH-125' into GH-147
rain1024 Feb 8, 2023
209e2e6
Merge remote-tracking branch 'origin/main' into GH-147
rain1024 Feb 8, 2023
a3b4278
update
rain1024 Feb 8, 2023
9c30cd9
update
rain1024 Feb 8, 2023
f870f8a
update
rain1024 Feb 8, 2023
dbf2df9
update
rain1024 Feb 8, 2023
dfc7914
update
rain1024 Feb 8, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
update
  • Loading branch information
@rain1024
rain1024 committed Feb 3, 2023
commit f3ab5f8b0e53e1168c6541de9affdff35375bd1c
4 changes: 2 additions & 2 deletions concepts/cpp/skip-list.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,8 @@

From wikipedia

> A skip list (or skiplist) is a probabilistic data structure that allows $O(log n)$
average complexity for search as well as $O(log n)$ average complexity for insertion
> A skip list (or skiplist) is a probabilistic data structure that allows $O(log\ n)$
average complexity for search as well as $O(log\ n)$ average complexity for insertion
within an ordered sequence of n elements.

## 🎨 Design
Expand Down