Closed saefstroem closed 7 months ago
O(log n)
average, O(n)
worst case for lookups, insertions, and deletions. I don't think the O(n)
worst case is likely to occur typically.
O(log n)
average,O(n)
worst case for lookups, insertions, and deletions. I don't think theO(n)
worst case is likely to occur typically.
Excellent, thanks for this.
What is the complexity of read write operations in SkipMap and SkipSet? These are rather important metrics that should be part of the README.md imo.