Skip to content

London | 26-SDC-March | Zobeir Rigi | Sprint 2 | Implement a skip list #208

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

Open
Zobeir-Rigi wants to merge 2 commits into
base: main
Choose a base branch
from
Open

London | 26-SDC-March | Zobeir Rigi | Sprint 2 | Implement a skip list #208

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
53027c3
Implement skip list
Zobeir-Rigi Jul 5, 2026
44dde92
Implement skip list using node levels
Zobeir-Rigi Jul 14, 2026
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
37 changes: 37 additions & 0 deletions Sprint-2/implement_skip_list/skip_list.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
class SkipList:
def __init__(self):
self.items = []

def insert(self, value):
left = 0
right = len(self.items)

while left < right:
mid = (left + right) // 2

if self.items[mid] < value:
left = mid + 1
else:
right = mid

self.items.insert(left, value)

@cjyuan cjyuan Jul 9, 2026

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The complexity of Python's list.insert() method is $O(n)$ in the worst case.

@Zobeir-Rigi Zobeir-Rigi Jul 14, 2026

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The complexity of Python's list.insert() method is O ( n ) in the worst case.

YES, You're right. I used binary search to find the insertion position, but I overlooked the fact that Python's list.insert() still has O(n) complexity because elements may need to be shifted. This means my implementation does not achieve the insertion complexity expected from a true Skip List.


def __contains__(self, value):
left = 0
right = len(self.items) - 1

while left <= right:
mid = (left + right) // 2

if self.items[mid] == value:
return True

if self.items[mid] < value:
left = mid + 1
else:
right = mid - 1

return False

def to_list(self):
return list(self.items)
Loading