From ecf1f74a700ec6146f319c9726063c2e5043072e Mon Sep 17 00:00:00 2001
From: sumanpatra2000 <69432331+sumanpatra2000@users.noreply.github.com>
Date: Thu, 1 Oct 2020 02:20:44 +0530
Subject: [PATCH] updation

---
 02-hash-table/README.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/02-hash-table/README.md b/02-hash-table/README.md
index 23c6548..3a235af 100644
--- a/02-hash-table/README.md
+++ b/02-hash-table/README.md
@@ -1,4 +1,7 @@
 # Hash table structure
+Hashing is an important Data Structure which is designed to use a special function called the Hash function which is used to map a given value with a particular key for faster access of elements. The efficiency of mapping depends of the efficiency of the hash function used.
+
+Let a hash function H(x) maps the value x at the index x%10 in an Array. For example if the list of values is [11,12,13,14,15] it will be stored at positions {1,2,3,4,5} in the array or Hash table respectively.
 
 Our key-value pairs (items) will each be stored in a `struct`: