a) Containers that implements data structures which can be accessed sequentially

b) Containers that implements sorted data structures for fast search in O(logn)

c) Containers that implements unsorted(hashed) data structures for quick search in O(1)

d) Containers that implements data structures which can be accessed non-sequentially

### 1 thought on “ What are Unordered Associative Containers?”

### Leave a Comment

You must be logged in to post a comment.

c

Explanation: Unordered Associative Containers is the subset of Containers that implements unsorted(hashed) data structures for quick search in O(1) amortized O(n) Worst case complexity.