[Python] Binary Search 구현

finding_target = 2
finding_numbers = [0, 3, 5, 6, 1, 2, 4]

def is_exist_target_number_binary(target, array):
    array = sorted(array)

    # index setting
    cur_min = 0
    cur_max = len(array) - 1
    cur_search = (cur_min + cur_max) // 2

    while cur_min <= cur_max:
        if array[cur_search] == target:
            return True
        elif array[cur_search] < target:
            cur_min = cur_search + 1
        else: # array[cur_search] > target
            cur_max = cur_search - 1
        cur_search = (cur_min + cur_max) // 2

    return False


result = is_exist_target_number_binary(finding_target, finding_numbers)
print(result)

 

 

참고 강의

https://www.inflearn.com/course/38%EA%B5%B0%EB%8D%B0-%ED%95%A9%EA%B2%A9%EB%B9%84%EB%B2%95-%EC%BD%94%ED%85%8C-%ED%95%84%EC%88%98-%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98/dashboard

38군데 합격 비법, 2024 코딩테스트 필수 알고리즘 강의 | 딩코딩코 - 인프런