二分查找和选择排序

# 二分查找

num_list = [2,4,6,8,10,12,14,16,18,30,50,80,90,100]
target = 12

# 在有序数列中找到target的索引

def binarySearch(target,num_list):
	min_index = 0
	max_index = len(num_list)-1
	mid_index = (min_index + max_index)//2

	while min_index <= max_index:
		if num_list[mid_index] == target:
			return mid_index
			break
		elif num_list[mid_index] < target:
			min_index = mid_index + 1
			mid_index = (min_index + max_index)//2
		else :
			max_index = mid_index - 1
			mid_index = (min_index + max_index)//2
	else:
		return None

# print(binarySearch(target,num_list))



# 选择排序
num_list = [8,6,7,11,5,9]

# 假设索引0 是最小的数字，从索引1 开始依次与索引0 比较，如果比索引0 还要小，就交换

def selection_sort(num_list):
	for j in range(1,len(num_list)):
		for i in range(j,len(num_list)):
			if num_list[j-1] > num_list[i]:
				num_list[j-1],num_list[i]=num_list[i],num_list[j-1]

	return num_list

# print(selection_sort(num_list))

# 问题：在[5,8,9,4,6,3,2,11] 找到6排在第几的位置（从小到大排序）？

num_list = selection_sort([5,8,9,4,6,3,2,11])

print(binarySearch(6,num_list)+1)