排序
冒泡排序
def maopao_paixu(a):
l = len(a)
for i in range(l-1): #遍历的是排好序的个数
for j in range(l-i-1): # 遍历的是待排序的个数
if a[j] > a[j+1]:
temp = a[j]
a[j] = a[j+1]
a[j+1] = temp
print(a)
return a
maopao_paixu([1,3,5,7,2,6,4,10,2,3])
1
2
3
4
5
6
7
8
9
10
11
插入排序
def charu_paixu(a):
l = len(a)
if l==1:
return 1
for i in range(1,l):
value = a[i]
j = i-1
for k in range(j,-1,-1):
if a[k] > value:
a[k+1] = a[k]
else:
j = k
break
a[j+1] = value
print(a)
return a
charu_paixu([1,3,5,7,2,6,4,10,2,3])
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
选择排序
def xuanze_paixu(a):
l = len(a)
for i in range(l-1): # 已经有i个排好序,i是排好序的队列的 下一个下标 ;队列组合 已排好的+a[k]+没排好的
k = i
for j in range(k+1,l):
if a[j] < a[k]:
k = j
if i!=k: # a[k](中间数)不是最小数;已排好的队列的后一个数不是最小数
temp = a[k]
a[k] = a[i]
a[i] = temp
print(a)
xuanze_paixu([1,3,5,7,2,6,4,10,2,3])
1
2
3
4
5
6
7
8
9
10
11
12
13
二分查找
def func(nums,target):
l = len(nums)
start,end = 0,l-1
while start<end:
mid = (start+end)//2
if nums[mid]==target:
return mid
elif nums[mid]<target:
start=mid+1
else:
end=mid-1
if nums[start]!= target:
return -1
return start
func([1,2,3,4,5,6,7,8,32,37,45,60,87,545,1010],9)
---------------------
作者:胖胖喵和豆丁鼠
来源:CSDN
原文:https://blog.csdn.net/weixin_42165200/article/details/89301595
版权声明:本文为博主原创文章,转载请附上博文链接!