A Pythonic indexed priority queue
-
Updated
Dec 1, 2025 - Python
A Pythonic indexed priority queue
SortedTables in Nim, based on B-Trees
Skip Lists: A generalization of sorted linked lists for implementing Dictionary ADT (insert, delete, find, min, floor, ceiling) in O(log n) expected time per operation. And competing with balanced search trees like AVL, Red-Black, and B-Trees.
Redis with Sorted Dictionaries
In this homework, you will implement and test custom dictionary-like classes in Python. You will also extend the standard OrderedDict to implement a cache with eviction logic. The goal is to practice working with Python data structures, generics, and algorithmic complexity considerations.
Python dictionary in which the keys are always in ascending order
Add a description, image, and links to the sorted-dict topic page so that developers can more easily learn about it.
To associate your repository with the sorted-dict topic, visit your repo's landing page and select "manage topics."