Open In App
Related Articles

ISRO | ISRO CS 2015 | Question 14

Improve Article
Improve
Save Article
Save
Like Article
Like

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

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 03 Apr, 2018
Like Article
Save Article
Previous
Next
Similar Reads