Q. Which of the following are true about unordered sequence container?
-
(A)
these are implements through unordered data structures that can be quickly searched
-
(B)
these are implements through data structures which can be accessed in a sequential manner
-
(C)
A & B both
-
(D)
these can be implemented through sorted data structures that can be quickly searched (O(log n) complexity).
✅ Correct Answer: (A)
these are implements through unordered data structures that can be quickly searched