Added 2 sorting methods

Author: shreyasvedpathak

binarysearch.py

@@ -1,6 +1,5 @@
 import math
 
-
 def bs_itr(A, n, key):
     low = 0
     high = n - 1
@@ -42,4 +41,4 @@ def bs_recur(A, key, low = 0, high = len(A) - 1):
 
 print("Recursive Binary Search output:", bs_recur(A, 10))
 print("Recursive Binary Search output:", bs_recur(A, 5))
-print("Recursive Binary Search output:", bs_recur(A, 2))
+print("Recursive Binary Search output:", bs_recur(A, 2))

sortingAlgo.py

@@ -0,0 +1,54 @@
+def selection(A):
+    """
+    Algo name: Selection Sort
+    UNSTABLE
+    input:
+    A -- Array
+
+    returns sorted array
+    """
+    n = len(A)
+    for i in range(n-1):
+        position = i
+        for j in range(i + 1, n):
+            if A[j] < A[position]:
+                position = j
+        A[i], A[position] = A[position], A[i]
+    print("Sorted using Selection Sort: ", A)
+
+def insertion(A):
+    """
+    Algo name: Insertion Sort
+    STABLE
+    input:
+    A -- Array
+
+    returns sorted array
+    """
+    n = len(A)
+
+    for i in range(1, n):
+        cvalue = A[i]
+        position = i
+        while position > 0 and A[position - 1] > cvalue:
+            A[position] = A[position - 1]
+            position = position - 1
+        A[position] = cvalue
+    
+    print("Sorted using Insertion Sort: ", A)
+
+def switch_case(choice):
+    if choice == 1:
+        selection(A),
+    elif choice == 2: 
+        insertion(A)
+
+
+A = list(map(int, input("Enter Array elements: ").split()))
+
+print("Select Sorting Method")
+print("1. Selection Sort")
+print("2. Insertion Sort")
+
+choice = int(input("Enter your choice: "))
+switch_case(choice)