diff --git a/README.md b/README.md
index 69cadbe..cf04dab 100644
--- a/README.md
+++ b/README.md
@@ -18,6 +18,8 @@
 - [Heap Sort](https://github.com/blackeye735/Sorting-Algorithms-in-Python/blob/master/Heapsort.py)
 - [Bucket Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/bucket_sort.py)
 - [Tree Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/tree_sort.py)
+- [ShellSort](https://github.com/saxena-rishabh/Sorting-Algorithms-in-Python/blob/master/ShellSort.py)
+
 
 
 ## Proposed List of Sorting Algos:
diff --git a/ShellSort.md b/ShellSort.md
new file mode 100644
index 0000000..9fd4cef
--- /dev/null
+++ b/ShellSort.md
@@ -0,0 +1,4 @@
+# ShellSort 
+[ShellSort](http://en.wikipedia.org/wiki/Shellsort) is mainly a variation of [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort). In insertion sort, we move elements only one position ahead. When an element has to be moved far ahead, many movements are involved. The idea of shellSort is to allow exchange of far items. In shellSort, we make the array h-sorted for a large value of h. We keep reducing the value of h until it becomes 1. An array is said to be h-sorted if all sublists of every h’th element is sorted.
+
+**Time Complexity:** Time complexity of above implementation of shellsort is O(n2). In the above implementation gap is reduce by half in every iteration. There are many other ways to reduce gap which lead to better time complexity. See [this](http://en.wikipedia.org/wiki/Shellsort#Gap_sequences) for more details.
diff --git a/ShellSort.py b/ShellSort.py
new file mode 100644
index 0000000..628b64a
--- /dev/null
+++ b/ShellSort.py
@@ -0,0 +1,43 @@
+# Python3 program for implementation of Shell Sort 
+
+def shellSort(arr): 
+
+	# Start with a big gap, then reduce the gap 
+	n = len(arr) 
+	gap = n//2
+
+	# Do a gapped insertion sort for this gap size. 
+	# The first gap elements a[0..gap-1] are already in gapped 
+	# order keep adding one more element until the entire array 
+	# is gap sorted 
+	while gap > 0: 
+
+		for i in range(gap,n): 
+
+			# add a[i] to the elements that have been gap sorted 
+			# save a[i] in temp and make a hole at position i 
+			temp = arr[i] 
+
+			# shift earlier gap-sorted elements up until the correct 
+			# location for a[i] is found 
+			j = i 
+			while j >= gap and arr[j-gap] >temp: 
+				arr[j] = arr[j-gap] 
+				j -= gap 
+
+			# put temp (the original a[i]) in its correct location 
+			arr[j] = temp 
+		gap //= 2
+
+
+
+arr = [12, 34, 54, 2, 3] 
+
+print("Array before sorting:") 
+print(*arr)
+
+#function call
+shellSort(arr) 
+
+print("Array after sorting:")
+print(*arr)