update notes
This commit is contained in:
@@ -27,7 +27,7 @@ Associative containers differ in 3 design dimensions
|
||||
Example: `set`, `multiset`, `map`, `multimap`
|
||||
|
||||
Ordered associative containers are tree structured
|
||||
- Insert/delete maintain sorted order, e.g. operator `<`
|
||||
- Insert/delete maintain sorted order, e.g. `operator<`
|
||||
- Don’t use sequence algorithms like `sort` or `find` with them
|
||||
- Already sorted, so sorting unnecessary (or harmful)
|
||||
- `find` is more efficient (logarithmic time) as a container method
|
||||
|
||||
Reference in New Issue
Block a user