A

Admin • 833K Points
Coach

Q. Which of the following are implemented through sorted data structures that can be quickly searched (O (log n) complexity)

  • (A) Associative Containers
  • (B) sequence container
  • (C) container adopter
  • (D) unordered associative containers
  • Correct Answer - Option(A)
  • Views: 14
  • Filed under category C++
  • Hashtags:

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.