Simple implementation of Binary Search algorithm in Python

BinarySearch.py

#   Simple implementation of Binary Search algorithm
#   Sorting included
from math import ceil


def Bsearch(item, list):
    s_index = int(ceil(len(list)/2))
    list.sort()
    found = False
    while True:
        try:
            if item == list[s_index]:
                found = True
                break
            else:
                if item > list[s_index]:
                    del list[:s_index]
                else:
                    del list[s_index:]
                s_index = int(ceil(len(list) / 2))
        except IndexError:
            found = False
            break
        print(list)
    return found


#   Test Case
test = [4, 6, 2, 6, 8, 9, 3, 5, 7, 11, 46, 74, 97]
print(Bsearch(13, test))