In an unsorted array of integers, what is the best time complexity achievable for searching for a specific value? - Study24x7
Social learning Network
2 followers study24x7 03 Jul 2024 10:57 AM study24x7 study24x7

In an unsorted array of integers, what is the best time complexity achievable for searching for a specific value?

A

O(1)

B

O(n)

C

O(log n)

D

O(n^2)

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles