Merge pull request #114 from dsrao711/issue_113

Python solution for insertion sorrt and selection sort

Author: smv1999

Sorting Algorithms/insertion_sort.py

@@ -0,0 +1,33 @@
+
+class Solution:
+    def insert(self, alist, index, n):
+        
+        sort = self.insertionSort(alist , n)
+        return sort
+    #Function to sort the list using insertion sort algorithm.    
+    def insertionSort(self, alist, n):
+        
+        for i in range(1 , n):
+            temp = alist[i]
+            j = i - 1
+            while(j >= 0 and temp < alist[j]):
+                alist[j+1] = alist[j]
+                j -= 1
+            alist[j+1] = temp
+            
+
+#{ 
+#  Driver Code Starts
+if __name__=="__main__":
+    t=int(input())
+    for i in range(t):
+        n=int(input())
+        arr=list(map(int,input().split()))
+    
+        Solution().insertionSort(arr,n)
+    
+        for i in range(n):
+            print(arr[i],end=" ")
+    
+        print()
+# } Driver Code Ends

Sorting Algorithms/selection_sort.py

@@ -0,0 +1,34 @@
+
+class Solution: 
+    def select(self, arr, i):
+        
+        minimum = i
+        j = i + 1
+        for j in range(j , n):
+            if(arr[j] < arr[minimum]):
+                minimum = j
+        return minimum
+            
+    
+    def selectionSort(self, arr,n):
+     
+        for i in range(0 , n):
+            minimum = self.select(arr , i)
+            if(minimum != i):
+                arr[i] , arr[minimum] = arr[minimum] , arr[i]
+                
+
+#{ 
+#  Driver Code Starts
+
+
+if __name__ == '__main__': 
+    t = int(input())
+    for _ in range(t):
+        n = int(input())
+        arr = list(map(int, input().strip().split()))
+        Solution().selectionSort(arr, n)
+        for i in range(n):
+            print(arr[i],end=" ")
+        print()
+# } Driver Code Ends