It said that
SortedMap
is a data structure with similar characteristics as BTreeMap but slightly different trade-offs: lookup, insertion, and removal are O(log(n)) and elements can be iterated in order cheaply.
But according to sorted_map.rs - source, its insert
method just called Vec::insert
, which should be O(n)
I wonder:
- Am I correct?
- If I was correct, who I should notify to correct this document?