Answer Posted / umesh
Hashing is a way to retrieve/store data on a constant time
independent of the value and position of the data present.
The position is a typically a function of the data stored.
| Is This Answer Correct ? | 6 Yes | 3 No |
Post New Answer View All Answers
What is the best complexity of bubble sort?
What are the difference between malloc() and calloc()?
How can someone display singly linked list from first to last?
How does hashset work internally in java?
Is array of data structure?
What are vectors used for in real life?
Which sorting algorithm is the slowest?
How do you sort a collection in descending order?
Calculate the efficiency of sequential search?
What is array and structure?
What data type is array?
Is bubble sort faster than selection sort?
Which type of memory allocation is referred for linked list?
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Which is better array or linked list?