Avaliando o tempo de execução de funções alternativas a função drop do Haskell

haskell_drop.py

#!/usr/bin/python3
import time

def test(fun, *args):
    t1 = time.time()
    fun(*args)
    t2 = time.time()
    return 'Exec. time: {}'.format(t1-t2)

def drop_loop(n, _list):
    for x in range(n):
        _list.pop(0)
    return _list

def drop_rec(n, _list):
    if n == 0:
        return _list
    _list.pop(0)
    return drop_rec(n-1, _list)

'''
Haskell:
Prelude> drop 100 [1..10000]
(0.19 secs, 52914384 bytes)
'''

# drop com recursão
print('[LOOP] %r ' % test(drop_loop, 100, [x for x in range(10000)]))

# drop com loop
print('[REC] %r ' % test(drop_rec, 100, [x for x in range(10000)]))