[코드없는 프로그래밍/Arrays] Binary Search

ㅇBinary Search

 

ㅇ 실습 - 파이썬

def binarySearch(nums, target):
    left = 0
    right = len(nums)

    while(left <= right):
        pivot = int((left + right)/2)
        if nums[pivot] == target:
            return pivot
        elif nums[pivot] < target:
            left = pivot + 1
        else:
            right = pivot - 1
    return -1

nums = [1,7,9,15,19,20]
target = 16

print(binarySearch(nums,target))

 

---

# 참고사이트

https://www.youtube.com/watch?v=Ix-7qWQr_RE&list=PLDV-cCQnUlIYFOXYzqLoXnEye4WxDa_30&index=3