二分查找
课程：Python · 编程练习
Python编程练习 - 二分查找
练习内容
# 二分查找算法\ndef binary_search(arr, target):\n left = 0\n right = len(arr) - 1\n\n while left <= right:\n mid = (left + right) // 2\n\n if arr[mid] == target:\n return m
课程：Python · 编程练习
Python编程练习 - 二分查找
# 二分查找算法\ndef binary_search(arr, target):\n left = 0\n right = len(arr) - 1\n\n while left <= right:\n mid = (left + right) // 2\n\n if arr[mid] == target:\n return m