Why is hashing used?
- 1 Answers
- 947 Views
- I also Faced
- E-Mail Answers
Answer / Akhalesh Kumar
Hashing is used primarily for data structure optimization and security purposes. In optimization, it's used in algorithms like hash tables to provide quick lookups due to its ability to quickly map keys to their respective values. In security, it's used for password storage in hashed form, as a way to protect sensitive information.
| Is This Answer Correct ? | 0 Yes | 0 No |
Tell me why might quick sort might be better than merge sort?
Which is the parent class of printerstatereasons class?
What are b tree keys?
What do you mean by free pool?
Is merge sort better than quick?
What is map entry?
How can we reverse a singly linked list?
Define double linked list?
Why do we use data structures?
How to inverting a function in sort and searching?
What are different types of linked lists?
What you mean by sorting?
Windows 
