diff --git a/Bogo sort b/Bogo sort
new file mode 100644
index 0000000..ac9fe05
--- /dev/null
+++ b/Bogo sort	
@@ -0,0 +1,44 @@
+###Bogo sort in python
+import random
+
+def sort(arr):
+
+    length = len(arr)
+
+    while (sorted_ele(arr) == False):
+
+        shuffle_ele(arr)
+
+def sorted_ele(arr):
+
+    length = len(arr)
+
+    for i in range(0, length - 1):
+
+        if (arr[i] > arr[i + 1]):
+
+            return False
+
+    return True
+
+           
+
+def shuffle_ele(arr):
+
+    length = len(arr)
+
+    for i in range(length):
+
+        r = random.randint(0, length-1)
+
+        arr[i], arr[r] = arr[r], arr[i]
+
+ip_arr = [10, 2, 51, 3]
+
+sort(ip_arr)
+
+print("The sorted array is: ")
+
+for i in range(0, len(ip_arr)):
+
+    print(ip_arr[i])
diff --git a/README.md b/README.md
index c0b6a11..f60218a 100644
--- a/README.md
+++ b/README.md
@@ -3,7 +3,4 @@
  - Bubble Sort
  - Insertion Sort
  - Heap Sort
- - Maximum of two numbers in Python
- - Python Program for simple interest
- - Python Program for factorial of a number
- 
+
diff --git a/Shell sort.py b/Shell sort.py
new file mode 100644
index 0000000..ae0de4d
--- /dev/null
+++ b/Shell sort.py	
@@ -0,0 +1,25 @@
+def shellsort(MyList): 
+  n = len(MyList)
+  gap = n // 2 
+  while gap > 0: 
+    for i in range(gap,n): 
+      temp = MyList[i] 
+      j = i 
+      while  j >= gap and MyList[j-gap] > temp: 
+        MyList[j] = MyList[j-gap] 
+        j = j - gap 
+      MyList[j] = temp 
+    gap = gap // 2
+
+def PrintList(MyList):
+  for i in MyList:
+    print(i, end=" ")
+  print("\n")
+               
+MyList = [10, 1, 23, 50, 4, 9, -4]
+print("Original List")
+PrintList(MyList)
+
+shellsort(MyList)
+print("Sorted List")
+PrintList(MyList)
diff --git a/Shell sort/Shell sort.py b/Shell sort/Shell sort.py
new file mode 100644
index 0000000..ae0de4d
--- /dev/null
+++ b/Shell sort/Shell sort.py	
@@ -0,0 +1,25 @@
+def shellsort(MyList): 
+  n = len(MyList)
+  gap = n // 2 
+  while gap > 0: 
+    for i in range(gap,n): 
+      temp = MyList[i] 
+      j = i 
+      while  j >= gap and MyList[j-gap] > temp: 
+        MyList[j] = MyList[j-gap] 
+        j = j - gap 
+      MyList[j] = temp 
+    gap = gap // 2
+
+def PrintList(MyList):
+  for i in MyList:
+    print(i, end=" ")
+  print("\n")
+               
+MyList = [10, 1, 23, 50, 4, 9, -4]
+print("Original List")
+PrintList(MyList)
+
+shellsort(MyList)
+print("Sorted List")
+PrintList(MyList)