冒泡排序、选择排序、快速排序、归并排序以及二分法模板
arr = [7,2,3,1,5,4,6]
print(arr)
def bubbleSort(arr):
n = len(arr)
isSort = True
for i in range(n-1):
for j in range(n-1-i):
if arr[j] > arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]
isSort = False
if isSort: break
return arr
def selectionSort(arr):
n = len(arr)
for i in range(n-1):
mini = i
for j in range(i+1, n):
if arr[mini] > arr[j]:
mini = j
arr[i], arr[mini] = arr[mini], arr[i]
return arr
def quickSort(arr, left, right):
if left < right:
partitonIndex = partition(arr, left, right)
quickSort(arr, left, partitonIndex - 1)
quickSort(arr, partitonIndex + 1, right)
return arr
def partition(arr, left, right):
pivot = arr[left]
i, j = left, right
while i < j:
while i < j and arr[j] >= pivot:
j -= 1
while i < j and arr[i] <= pivot:
i += 1
arr[i], arr[j] = arr[j], arr[i]
arr[left], arr[j] = arr[j], arr[left]
return j
def mergeSort(arr):
if len(arr) < 2: return arr
mid = len(arr) // 2
left = mergeSort(arr[0:mid])
right = mergeSort(arr[mid:])
return merge(left, right)
def merge(left, right):
res = []
while left and right:
if left[0] < right[0]:
res.append(left.pop(0))
else:
res.append(right.pop(0))
while left:
res.append(left.pop(0))
while right:
res.append(right.pop(0))
return res
def binarySearch(arr, tar):
left, right = 0, len(arr)-1
while left <= right:
mid = (left + right) // 2
if tar > arr[mid]:
left = mid + 1
elif tar == arr[mid]:
return mid
else:
right = mid - 1
return -1
index = binarySearch([5,2,3,6,1,4], 4)