|
gptkbp:instance_of
|
gptkb:architect
|
|
gptkbp:bfsLayer
|
7
|
|
gptkbp:bfsParent
|
gptkb:System._Collections._Generic
|
|
gptkbp:allows
|
deletion of elements
insertion of elements
|
|
gptkbp:analyzes
|
a balanced tree
|
|
gptkbp:can_be_extended_by
|
gptkb:theorem
|
|
gptkbp:can_be_used_with
|
custom comparison functions
other data structures
|
|
gptkbp:can_create
|
gptkb:theorem
|
|
gptkbp:communication
|
gptkb:file_format
|
|
gptkbp:created_by
|
an iterable
|
|
gptkbp:genetic_diversity
|
gptkb:theorem
|
|
gptkbp:has_transformation
|
regular list
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Sorted List
|
|
gptkbp:hyper_threading
|
gptkb:theorem
|
|
gptkbp:is_available_in
|
Python 2 and 3
|
|
gptkbp:is_available_on
|
gptkb:Py_PI
|
|
gptkbp:is_compatible_with
|
Num Py arrays
|
|
gptkbp:is_designed_for
|
performance and efficiency
|
|
gptkbp:is_documented_in
|
official Python documentation
|
|
gptkbp:is_effective_against
|
range queries
|
|
gptkbp:is_implemented_in
|
gptkb:Library
dynamic arrays
|
|
gptkbp:is_maintained_by
|
community contributors
|
|
gptkbp:is_often_compared_to
|
other list types
|
|
gptkbp:is_often_used_in
|
data analysis
competitive programming
algorithm implementations
|
|
gptkbp:is_optimized_for
|
frequent insertions and deletions
|
|
gptkbp:is_part_of
|
sortedcontainers library
sortedcontainers module
|
|
gptkbp:is_used_for
|
maintaining sorted order
|
|
gptkbp:is_used_in
|
machine learning applications
priority queues
|
|
gptkbp:length
|
n elements
|
|
gptkbp:provides
|
finding indices
|
|
gptkbp:storage
|
duplicate elements
|
|
gptkbp:suitable_for
|
real-time applications
|
|
gptkbp:supports
|
binary search
|
|
gptkbp:travel_time
|
O(log n) for search
O(n) for deletion
O(n) for insertion
|
|
gptkbp:type_of
|
gptkb:collection
Sorted Containers
|