Question

what is hashing techniques to solve the collision problems​

Answer 1

Answer:

hhrhfhfhhfufjififjnfhfhhfhfhfhfhfhfhhfhfjf

Answer 2

${\huge {\underline {\mathfrak {\purple{Answer}}}}}$

We were able to make improvements in our search algorithms by taking advantage of information about where items are stored in the collection with respect to one another. For example, by knowing that a list was ordered, we could search in logarithmic time using a binary search. In this section we will attempt to go one step further by building a data structure that can be searched in O(1) time. This concept is referred to as hashing.

_________________________