Python list search benchmark

#!/usr/bin/env python

import random
import timeit

def contains(small, big):
    for i in xrange(len(big)-len(small)+1):
        for j in xrange(len(small)):
            if big[i+j] != small[j]:
                break
        else:
            return i, i+len(small)
    return False



s = [random.random() for i in xrange(0, 1000)]
b = [random.random() for i in xrange(0, 1000000)]
b.extend(s)

if __name__ == '__main__':
    t = timeit.Timer('contains(s,b)', 'from __main__ import contains, s, b')
    print t.timeit(10)