Function find_index

DSA/find_Insert_position.py:4–13

(arr, n, K)

# 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)