London | 25-SDC-July | Ali Qassab | Sprint 2 | Implement a Skip List

[AliQassab]

Learners, PR Template

Self checklist

• I have titled my PR with Region | Cohort | FirstName LastName | Sprint | Assignment Title
• My changes meet the requirements of the task
• I have tested my changes
• My changes follow the style guide

Changelist

Implemented simplified SkipList data structure:

• insert(value) - O(n) insertion in sorted order using binary search
• contains(value) - O(log n) lookup using binary search
• to_list() - O(1) conversion to sorted list
  Uses simple sorted list with binary search instead of complex multi-level structure for better maintainability.

Questions

Ready for review! All tests pass.

[OracPrime]

Almost!

[OracPrime]

Although you've found the insertion point in O(log(n)) this insert call is O(n), so your overall insert is O(n), which doesn't meet requirements

[AliQassab]

Fixed! Replaced the list-based implementation with a proper skip list using linked nodes and multiple levels. This achieves O(log n) insertion by updating pointers instead of using list.insert() which is O(n).