ArpitSachan · Jan 29, 2020 · Jan 29, 2020 · Jan 29, 2020
diff --git a/README.md b/README.md
@@ -12,6 +12,7 @@ Algorithms covered so far:
 | Insertion Sort | insertion_sort |
 | Heap Sort | heap_sort |
 | Merge Sort | merge_sort |
+| Shell Sort | shell_sort |
 
 # Usage:
 

diff --git a/sorting.py b/sorting.py
@@ -212,3 +212,19 @@ def _quick_sort(items, low, high):
             _quick_sort(items, split_index + 1, high)
 
     _quick_sort(nums, 0, nums.get_len() - 1)
+    def shell_sort(nums): 
+
+    n=nums.get_len()
+    gap=n//2
+
+    while gap>0: 
+
+        for i in range(gap,n): 
+            temp=nums[i] 
+            j=i 
+            while  j>=gap and nums[j-gap]>temp: 
+                nums[j]=nums[j-gap] 
+                j-=gap 
+
+            nums[j]=temp 
+        gap //= 2
diff --git a/test.py b/test.py
@@ -21,6 +21,6 @@ def test(sorting_function):
 
 
 functions = [s.bubble_sort, s.heap_sort, s.selection_sort,
-             s.insertion_sort, s.quick_sort, s.merge_sort]
+             s.insertion_sort, s.quick_sort, s.merge_sort, s.shell_sort]
 for function in functions:
     print('Testing:   ', function.__name__.ljust(16), test(function))