七大排序算法—leetcode刷题（python版）

一、七大查找算法
1.1 顺序查找算法
代码：

def Sequence_Search(nums, target):
		n = len(nums)
		if n==0:
			return False
		for i in range(n):
			if nums[i]==target:
			    return True
		return False

1.2 二分查找
代码：

def binary_Search(nums,target):
	n=len(nums)
	if n==0:
		return False
	low = 0
	high = n-1
	while low <= high:
		mid = (low+high)//2
		if nums[mid] == target:
			return mid   //return Ture
		elif nums[mid] < target:
			low = mid + 1
		else:
            high = mid - 1
	return False