선형탐색, 이분 탐색(Binary search, lower_bound, upper_bound, parametric search)

1. 선형탐색 2. 이분탐색 이분탐색 구현 코드 더보기 C++ int arr[100001]; bool binary_search(int start, int end, int seek){ while(startseek) end = mid - 1; else start = mid + 1; } return false; } Python def binary_search(arr, target): left = 0 right = len(arr) -1 while left