Added features

Author: divyanshu1810

insertionSort.py

@@ -0,0 +1,21 @@
+# Insertion sort in Python
+def insertionSort(array):
+
+    # keep track of swapping
+    
+    # loop through each element of array
+    for i in range(1,len(array)):
+
+        # Setting the desired key element
+        key=array[i]
+        j=i-1
+
+        # Swapping the key and compared number 
+        # swapping occurs if elements
+        # are not in the intended order 
+        while((j>-1) and (array[j]>key)):
+            array[j+1]=array[j]
+            j=j-1
+        
+        array[j+1]=key
+    

selectionSort.py

@@ -0,0 +1,37 @@
+# Selection sort in Python
+
+
+def selectionSort(array):
+
+    # keep track of swapping
+    swapped = False
+
+    # loop through each element of array
+    for i in range(len(array)):
+
+        # for keeping the smallest integer
+        index = i
+
+        # loop to compare array elements
+        for j in range(i+1,len(array)):
+
+            # change > to < to sort in descending order
+            if array[j]<array[index]:
+
+                # index is equal to the condition number
+                index=j
+
+                swapped=True
+
+        # swapping occurs if elements
+        # are not in the intended order
+
+        temp=array[i]
+        array[i]=array[index]
+        array[index]=temp
+       
+        # no swapping means the array is already sorted
+        # so no need for further comparison
+        if not swapped:
+            break
+

sorting.py

@@ -6,6 +6,8 @@
 import matplotlib.animation as animation
 from bubbleSort import bubbleSort
 from quickSort import quickSort
+from insertionSort import insertionSort
+from selectionSort import selectionSort
 
 
 # plt.style.use('dark_background')
@@ -76,8 +78,8 @@ def __repr__(self):
 arr = TrackedArray(arr)
 
 # function call for bubble sort
-bubbleSort(arr)
-
+# bubbleSort(arr)
+insertionSort(arr)
 # function call for quick sort
 #quickSort(arr, 0, len(arr)-1)