Which of the following is NOT a benefit of using hash tables for data storage…
2024
Which of the following is NOT a benefit of using hash tables for data storage and retrieval ?
- A.
Fast average-case search time.
- B.
Efficient memory usage
- C.
Guaranteed constant-time search
- D.
Ordered data representation
Attempted by 73 students.
Show answer & explanation
Correct answer: C
Hash tables offer O(1) average-case time complexity for search, insert, and delete operations. However, they do not guarantee constant-time performance in all cases because hash collisions can degrade performance to O(n) worst-case.
Loading lesson…