Get App

Python: Which practice avoids a common mistake with bisect on Sorted Lists?

Difficulty:

Medium

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

Which practice avoids a common mistake with bisect on Sorted Lists?

  1. Do not describe bisect-based insertion as fully logarithmic because the search is fast but the actual list insertion still shifts elements.
  2. Ignore the bisect on Sorted Lists issue and rely on team discipline instead of clearer APIs or invariants.
  3. Silence the bisect on Sorted Lists problem by using broad catches, hidden globals, or extra shared mutable state.
  4. Prefer the version of bisect on Sorted Lists that makes behavior less predictable as long as the code still runs.

Hint

Look for the option that protects correctness instead of hiding the problem.

Answer and rationale

Correct answer: A. Do not describe bisect-based insertion as fully logarithmic because the search is fast but the actual list insertion still shifts elements.

Do not describe bisect-based insertion as fully logarithmic because the search is fast but the actual list insertion still shifts elements. This is a common failure mode in real Python code and a frequent interview follow-up.

Track: Python