Given sorted_nums = [1, 3, 7, 12, 18, 25, 33, 40, 55, 68, 82], implement O(log n) binary search for

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Problem

Given sorted_nums = [1, 3, 7, 12, 18, 25, 33, 40, 55, 68, 82], implement O(log n) binary search for target = 33. Print the index where 33 is found. If not found, print -1.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.