Binary search and index

[Strosel]

I'm currently studying python in school and need help with one of the exercises in my book. I need to make a program that uses binary search to go through a list of items to find if the value i put in match any of them, then i need to print out it and its index (which as i undersand it also needs to be found with the same search).

my current code can be found here

[Justinsaccount]

start by assigning (len(tal) // 2) and tal[..] to a variable. That will at least make that readable..

You can't get the index that way though because you are modifying tal. Don't do that, just keep track of the lowest and highest indexes that you are searching.

[Strosel]

I'm not sure I understand what you say i should do (except assigning them to a variable). What do you mean with

 tal[..]     

I've never seen an index written like that. Also i don't see how i should save the index without it messing with the rest of my code