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
💬 Discuss
✅ Correct Answer: (A) Associative Containers

Published by Tina Singh ⭐ 14.41K Points at 13-Mar-2023 06:30 am in C++

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️
248
Total Visits
📽️
4 y ago
Published
🎖️
Tina Singh
Publisher
📈
93%
Success Rate