ISRO | ISRO CS 2015 | Question 14

Which searching technique takes O(1) time complexity for searching the data?

(A)

Binary Search

(B)

Linear Search

(C)

AVL Tree Search

(D)

Hashing

Answer: (D)

Explanation:

Hashing is the technique that takes O(1) time complexity for searching the data.

Quiz of this Question
Please comment below if you find anything wrong in the above post