Python Binary Search with Bisect

Background

The bisect module provides O(log n) binary search operations on sorted lists, used for ranking and insertion.

Problem

Write a function that takes a sorted list and a target, returning the insertion point using bisect and whether the target exists.

Input

A sorted list of numbers and a target number.

Output

A tuple of (insertion_index, exists_boolean).

Sample tests

Input: [1, 3, 5, 7, 9], 6

Expected: (3, False)

Your solution

Learning objective

Learn the bisect module for binary search and insertion point finding.