Home

1. (2024/1/15) when searching a sorted array using methods like binary search, it's not obvious about which index to return, should I return low, or "low + 1", or "high - 1", how to reason about the return value of bisect_right() and bisect_left() in the following file:

https://github.com/OccupyMars2025/cpython/blob/main/Lib/bisect.py

solution: https://github.com/OccupyMars2025/dengjunhui-data-structure-cpp-source-code/issues/4#issuecomment-1892153325