Mindset model In binary search, key points: if right is defined as len(nums) - 1, then search space is between [left, right] termination condition: while (left <= right) in each shrinking iteration: left = mid + 1 and right = mid - 1 final state: left == right + 1 if right is defined as len(nums), then search space is between [left, right) termination condition: while (left < right) in each shrinking iteration: left = mid + 1 but right = mid final state: left == right for left bound searching, right = mid (-1) if f(mid) == target, return left (this will be immediate ceiling item if target is not in f(x)) for right bound searching, left = mid + 1 if f(mid) == target, return left - 1 (this will be immediate floor item if target is not in f(x)) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 # monotone function def f(x: int) -> int: pass # binary search to get target def binary_search(nums: List[int], target: int) -> int: if len(nums) == 0: return -1 left = .

A review on basic operation of sliding window.

A review on basic operation of list reversing.

A review on backtracking algorithm.

Nicolas Collins (born March 26, 1954 in New York City) has been composing and performing since the early 1970s. He studied composition with Alvin Lucier at Wesleyan University (received both B.A. and M.A. there) and worked for several years with David Tudor.