二分查找、快速排序、冒泡排序、选择排序

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        l = 0
        r = len(nums) - 1
        while l <= r:
            mid = l + (r - l) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                r = mid - 1
            else:
                l = mid + 1
        return -1

def quick(nums, start, end):
    if start >= end:
        return
    l = start
    r = end
    pivot = nums[l]
    while l < r:
        while l < r and nums[r] >= pivot:
            r -= 1
        nums[l] = nums[r]
        while l < r and nums[l] <= pivot:
            l += 1
        nums[r] = nums[l]
    nums[l] = pivot
    quick(nums, start, l - 1)
    quick(nums, l + 1, end)

l1 = [32, 15, 10, 31, 33]
quick(l1, 0, len(l1)-1)
print(l1)

def bubble_sort(nums):
    for i in range(len(nums)):
        for j in range(len(nums) - i - 1):
            if nums[j] > nums[j + 1]:
                nums[j], nums[j + 1] = nums[j + 1], nums[j]

nums = [4, 1, 0, -10, 123]
bubble_sort(nums)
print(nums)

def choice_sort(nums):
    for i in range(len(nums)):
        for j in range(i, len(nums)):
            if nums[j] < nums[i]:
                nums[j], nums[i] = nums[i], nums[j]

nums = [4, 1, 0, -10, 123]
choice_sort(nums)
print(nums)