this post was submitted on 13 Dec 2025
129 points (99.2% liked)
Programming
24348 readers
235 users here now
Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!
Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.
Hope you enjoy the instance!
Rules
Rules
- Follow the programming.dev instance rules
- Keep content related to programming in some way
- If you're posting long videos try to add in some form of tldr for those who don't want to watch videos
Wormhole
Follow the wormhole through a path of communities !webdev@programming.dev
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Implementing a probabilistic skiplists.
Because standard linked lists use traversal methods instead of quick memory access like arrays it's computationally straining to traverse through 1000000 elements. A skiplist skips nodes by adding an additional dimension to the linked and its probabilistic for adding and removing nodes where as the idealized version requires reconstructing the entire list.