#211 (#219)

Searching & sorting/Sorting/ShellSort/solution.py

@@ -0,0 +1,17 @@
+# Shell sort in python
+
+
+def shellSort(array, n):
+
+    # Rearrange elements at each n/2, n/4, n/8, ... intervals
+    interval = n // 2
+    while interval > 0:
+        for i in range(interval, n):
+            temp = array[i]
+            j = i
+            while j >= interval and array[j - interval] > temp:
+                array[j] = array[j - interval]
+                j -= interval
+
+            array[j] = temp
+        interval //= 2

Searching & sorting/Sorting/ShellSort/test_solution.py

@@ -0,0 +1,12 @@
+from .solution import shellSort
+import pytest
+
+print(pytest)
+
+numbers = [9, 8, 3, 7, 5, 6, 4, 1]
+Ans = sorted(numbers)
+
+
+def test_sort_Asce():
+    shellSort(numbers,len(numbers))
+    assert numbers == Ans