it is possible to find a element in unsorted array in o(n) or lesser complexity ?
You can use Hashing and take a sufficiently large table size to compute in O(1).
can u provide proper source code or related resource to read about
it is possible to find a element in unsorted array in o(n) or lesser complexity ?
You can use Hashing and take a sufficiently large table size to compute in O(1).
can u provide proper source code or related resource to read about