does anyone know how to test a recursive bianry search to check if it works

I think that you are asking for help in seeing that your function actually goes through all the steps of binary search on a list. Why don't you create a small test list and place a print statement in your code that displays the sublist that is sent back to the function at each recursive call. Since the list is small you can easily tell what the proper search path should be. If the output is what you should be seeing then it is likely that your code works.

You might find this is interesting: http://www.paulbutler.org/archives/p...th-decorators/

ur link didnt help but ive solved it thx