﻿ Python Bisect: Find the index position of the largest value smaller than a given number in a sorted list using Binary Search - w3resource

# Python Bisect: Find the index position of the largest value smaller than a given number in a sorted list using Binary Search

## Python Bisect: Exercise-5 with Solution

Write a Python program to find the index position of the largest value smaller than a given number in a sorted list using Binary Search (bisect).

Sample Solution:

Python Code:

``````from bisect import bisect_left
def Binary_Search(l, x):
i = bisect_left(l, x)
if i:
return (i-1)
else:
return -1
nums = [1, 2, 3, 4, 8, 8, 10, 12]
x = 5
num_position  = Binary_Search(nums, x)
if num_position  == -1:
else:
print("Largest value smaller than ", x, " is at index ", num_position )
```
```

Sample Output:

```Largest value smaller than  5  is at index  3
```

Flowchart:

## Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:

Python Code Editor:

Next: Write a Python program to find the index position of the last occurrence of a given number in a sorted list using Binary Search (bisect).

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## Python: Tips of the Day

How to make a chain of function decorators?

```from functools import wraps

def makebold(fn):
@wraps(fn)
def wrapped(*args, **kwargs):
return "<b>" + fn(*args, **kwargs) + "</b>"
return wrapped

def makeitalic(fn):
@wraps(fn)
def wrapped(*args, **kwargs):
return "<i>" + fn(*args, **kwargs) + "</i>"
return wrapped

@makebold
@makeitalic
def hello():
return "hello world"

@makebold
@makeitalic
def log(s):
return s

print hello()        # returns "<b><i>hello world</i></b>"
print hello.__name__ # with functools.wraps() this returns "hello"
print log('hello')   # returns "<b><i>hello</i></b>"
```

Ref: https://bit.ly/3cVz5iw