NeetCode 14번 알고리즘: Search Array (Binary Search)

NeetCode 링크 : https://neetcode.io/courses/dsa-for-beginners/14

 

Binary Search 

 

Code 

arr = [1, 3, 3, 4, 5, 6, 7, 8]

def binarySearch(arr, target):
    L, R = 0, len(arr) - 1

    while L <= R:
        mid = (L + R) // 2

        if target > arr[mid]:
            L = mid + 1
        elif target < arr[mid]:
            R = mid - 1
        else:
            return mid
    return -1

 

Complexity

Time Complexity: O(logn)

Space Complexity: O(1)