why is binary search faster than list.index() method?

  binary-search, python-3.x

I was using binary search to find index of an item in a list. I used list.index() method for the same. I used time.time() to find out the time difference between the two algorithms. The result I got was binary search was 10000 times faster than list.index(). Why is that? Does list.index() follow linear search algorithm?

Source: Python-3x Questions