Merge pull request BeeBombshell#121 from chickenCHRISpy/chris-dsa-hacktoberfest

added a classic dsa problem

Author: BeeBombshell

DSA/find_Insert_position.py

@@ -0,0 +1,18 @@
+
+
+# Function to find insert position of K
+def find_index(arr, n, K):
+	
+	for i in range(n):
+		if arr[i] == K:
+			return i
+			
+		elif arr[i] > K:
+			return i
+			
+	return n
+
+arr = [1, 3, 5, 6, 8]
+n = len(arr)
+K = 2
+print(find_index(arr, n, K))