def func1(x):print(x)func1(x-1)def func2(x):if x>0:print(x)func2(x+1)def func3(x):if x>0:print(x)func3(x-1)def func4(x):if x>0:func4(x-1)print(x)

def bin_search(data_set,val):'''mid：下标low：每次循环的列表最左边下标high：每次循环的列表最右边下标:param data_set:列表:param val: 要找的值:return:'''low = 0high = len(data_set)-1while low <= high:mid = (low+high)//2if data_set[mid] == val:return midelif data_set[mid] > val:high = mid - 1else:low = mid + 1return

import random,time#装饰器
def cal_time(func):def wrapper(*args,**kwargs):t1 = time.time()ret = func(*args,**kwargs)t2 = time.time()print('time cost: %s \r\nfunc from %s'%(t2-t1,func.__name__))return funcreturn wrapper@cal_time
def bubble_sort(li):for i in range(len(li) - 1):for j in range(len(li) - i - 1):#升续if li[j] > li[j+1]:li[j],li[j+1]=li[j+1],li[j]#降续# if li[j] < li[j+1]:#     li[j],li[j+1]=li[j+1],li[j]
data = list(range(1000))
random.shuffle(data)
print(data)
bubble_sort(data)
print(data)

import random,time#装饰器
def cal_time(func):def wrapper(*args,**kwargs):t1 = time.time()ret = func(*args,**kwargs)t2 = time.time()print('time cost: %s \r\nfunc from %s'%(t2-t1,func.__name__))return funcreturn wrapper@cal_time
def bubble_sort(li):for i in range(len(li) - 1):exchange = Falsefor j in range(len(li) - i - 1):#升续if li[j] > li[j+1]:li[j],li[j+1]=li[j+1],li[j]exchange = True#降续# if li[j] < li[j+1]:#     li[j],li[j+1]=li[j+1],li[j]#     exchange = True#这里是指上一趟，值之间没有发生交换，就退出循环if not exchange:breakdata = list(range(1000))
random.shuffle(data)
print(data)
bubble_sort(data)
print(data)

import random,time#装饰器
def cal_time(func):def wrapper(*args,**kwargs):t1 = time.time()ret = func(*args,**kwargs)t2 = time.time()print('time cost: %s --> \nfunc from %s'%(t2-t1,func.__name__))return funcreturn wrapper@cal_time
def select_sort(li):for i in range(len(li)-1):min_loc = ifor j in range(i+1,len(li)):if li[j] < li[min_loc]:min_loc = jli[i],li[min_loc] = li[min_loc],li[i]

def insert_sort(li):for i in range(1,len(li)):tmp = li[i]j = i - 1while j >= 0 and tmp < li[j]:li[j + 1] = li[j]j -= 1li[j + 1] = tmp

import randomdef random_list(n):ids = range(1000,1000+n)result = []a1 = ["王","陈","李","赵","钱","孙","武"]a2 = ["丹","泽","","","晶","杰","金"]a3 = ["强","华","国","富","宇","齐","星"]for i in range(n):age = random.randint(16,38)id = ids[i]name = '%s%s%s'%(random.choice(a1),random.choice(a2),random.choice(a3))dic = {}dic['id'] = iddic['姓名'] = namedic['年龄'] = ageresult.append(dic)return resultdef bubble_sort(li):for i in range(len(li)-1):for j in range(len(li)-i-1):if li[j]['id'] > li[j+1]['id']:li[j],li[j+1] = li[j+1],li[j]data1 = random_list(100)
random.shuffle(data1)
print(data1)
bubble_sort(data1)
print(data1)

import time,random,copydef cal_time(func):def wrapper(*args,**kwargs):t1 = time.time()ret = func(*args,**kwargs)t2 = time.time()print('time cost： %s from %s'%(t2-t1,func.__name__))return funcreturn wrapperdef quick_sort_x(data,left,right):#这里的left和right是定义列表data，最少有两个元素if left<right:#partition分割函数，mid是放好的元素的下标mid = partition(data,left,right)#以下类似二分quick_sort_x(data,left,mid-1)quick_sort_x(data,mid+1,right)#快排的复杂度是O（nlog（n）），这是一个特殊情况
def partition(data,left,right):#获取左边的第一个元素，这里写left不能写零，因为后面需要递归tmp = data[left]#终止条件为当left和right碰上时，所以左小于右时为while循环的条件（left和right是下标）while left < right:#循环条件是右边比tmp大，直到找到右边比tmp小的数，停止循环while left < right and data[right] >= tmp:right -= 1#把找到的右边比tmp小的数移到左边空出来的位置data[left] = data[right]#循环条件是左边比tmp小，继续循环，直到找到左边比tmp大的数，结束循环while left < right and data[left] <= tmp:left += 1#把左边找到的大于tmp的数移到右边空出来的位置data[right] = data[left]#当左右相等时,就把tmp放到left和right碰到的位置data[left] = tmp#mid的值和lef或right值相同，return哪个都可以#mid = left# return midreturn left#对递归函数的装饰，需要再封装一层
@cal_time
def quik_sort(data):#0及是left，len(data)-1为rightreturn quick_sort_x(data,0,len(data)-1)

import time,random,copydef cal_time(func):def wrapper(*args,**kwargs):t1 = time.time()ret = func(*args,**kwargs)t2 = time.time()print('time cost： %s from %s'%(t2-t1,func.__name__))return funcreturn wrapperdef quick_sort_x(data,left,right):#这里的left和right是定义列表data，最少有两个元素if left<right:#partition分割函数，mid是放好的元素的下标mid = partition(data,left,right)#以下类似二分quick_sort_x(data,left,mid-1)quick_sort_x(data,mid+1,right)#快排的复杂度是O（nlog（n）），这是一个特殊情况
def partition(data,left,right):#获取左边的第一个元素，这里写left不能写零，因为后面需要递归tmp = data[left]#终止条件为当left和right碰上时，所以左小于右时为while循环的条件（left和right是下标）while left < right:#循环条件是右边比tmp大，直到找到右边比tmp小的数，停止循环while left < right and data[right] >= tmp:right -= 1#把找到的右边比tmp小的数移到左边空出来的位置data[left] = data[right]#循环条件是左边比tmp小，继续循环，直到找到左边比tmp大的数，结束循环while left < right and data[left] <= tmp:left += 1#把左边找到的大于tmp的数移到右边空出来的位置data[right] = data[left]#当左右相等时,就把tmp放到left和right碰到的位置data[left] = tmp#mid的值和lef或right值相同，return哪个都可以#mid = left# return midreturn left#对递归函数的装饰，需要再封装一层
@cal_time
def quik_sort(data):#0及是left，len(data)-1为rightreturn quick_sort_x(data,0,len(data)-1)#冒泡排序
@cal_time
def bubble_sort(li):for i in range(len(li) - 1):exchange = Falsefor j in range(len(li) - i - 1):#升续if li[j] > li[j+1]:li[j],li[j+1]=li[j+1],li[j]exchange = True#降续# if li[j] < li[j+1]:#     li[j],li[j+1]=li[j+1],li[j]#     exchange = True#这里是指上一趟，值之间没有发生交换，就退出循环if not exchange:breakdata = list(range(5000))
random.shuffle(data)
#深度拷贝
data1 = copy.deepcopy(data)
data2 = copy.deepcopy(data)#快排和冒泡的比较
quik_sort(data1)
bubble_sort(data2)
print(data1)