performance comparison among bunch of sorting algorithms it computes the time used in each algorithm to sort list of: Sorted numbers and Unsorted numbers
Adds Pydantic support to sortedcontainers.
Python implementations of optimized data structures: an integer stack with O(1) max retrieval and a sorted number container supporting efficient removal, filtering, and deduplication, fully covered by unit tests.
Sorting any number of any strings in alphabetical order
Python implementations of Club and Dictionary classes showcasing efficient collection management. The project uses sorted containers for fast range queries, multi-key sorting, and case-insensitive prefix search, with full unit test coverage.
Add a description, image, and links to the sorted-lists topic page so that developers can more easily learn about it.
To associate your repository with the sorted-lists topic, visit your repo's landing page and select "manage topics."