Merge pull request Aishanipach#14 from musaibbatghar/main

Insertion Sort Algorithm Implementation

Author: Aishanipach

Insertion_Sort.py

@@ -0,0 +1,22 @@
+
+def insertionSort(arr):
+
+	for i in range(1, len(arr)):
+
+		key = arr[i]
+		j = i-1
+		while j >=0 and key < arr[j] :
+				arr[j+1] = arr[j]
+				j -= 1
+		arr[j+1] = key
+
+
+arr = [12, 11, 13, 5, 6]
+insertionSort(arr)
+lst = []
+print("Sorted array is : ")
+for i in range(len(arr)):
+	lst.append(arr[i])
+print(lst)
+
+

README.md

@@ -33,4 +33,4 @@ Feel free to add basic python scripts/programs that helped you learn python. I h
 16. [email response sender](https://github.com/arnavvgupta/email-response-sender) - [Arnav Gupta](https://github.com/arnavvgupta)
 17. [Quick Sort](https://github.com/varshaah2407/Beginners-Python-Projects/blob/main/quick_sort.py) - [Varshaah Shashidhar](https://github.com/varshaah2407)
 18. [aritmetic median, biggest number and lowest number](https://github.com/arnavvgupta/functionMaxMinMedian.py) 
-
+19. [Insertion Sort](https://github.com/musaibbatghar/Beginners-Python-Projects/blob/main/Insertion_Sort.py) - [Musaib Batghar](https://github.com/musaibbatghar)