Open In App
Related Articles

ISRO | ISRO CS 2015 | Question 14

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

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

Last Updated : 03 Apr, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads