Multiple choice

Which of the following searching methods takes a time complexity of O(1) to search an element?

  1. Linear search

  2. Binary search

  3. Hash based search (Hashing)

  4. Tree based search

  5. None of the above
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

yes, hashing or hash based search is used to find the element in O(1). Hashing generates a unique code which is used to look for an element in the data structure

Keep practicing — related questions