Cacher is the code snippet organizer for pro developers

#split search implememtation
#f

def split_num(n):
	if n % 2 == 0:
		return (n//2, n//2)
	else:
		return (n//2, (n//2)+1)
		
def split_list(lst):
	size = len(lst)//2
	return [lst[size:], lst[:size]]
	
def split_search(lst, value):
	if lst[0] == value:
		return True
	elif len(lst) == 1 and lst[0] != value:
		return False
	else:
		lst = split_list(lst)
		return [split_search(lst[i], value) for i in range(2)]