Code bisection has the goal of minimizing the effort to find a specific change set.
It employs a divide and conquer algorithm that depends on having access to the code history which is usually preserved by revision control in a code repository.