Binary Search

 Binary Search

QUESTION DESCRIPTION

Write a program to implement binary search algorithm

n=int(input())

l=[]

for i in range(0,n):

  val=int(input())

  l.append(val)

s=[]

sn=int(input())

for i in range(0,sn):

  val2=int(input())

  s.append(val2)

flag=0

for i in range (0,n):

  if l[i]==s[0] and l[i+1]==s[1] and l[i+2]==s[2]:

    print('Sequence found between index',i,'and',i+sn)

    flag=1

if flag==0:

  print("Not found")