List Comprehensions

[Yoriz]

If the size of the list is increased it makes the results of timeit show that comprehensions are faster

import timeit
ordinary_loop = '''
lst = range(10000000)
l = []
for i in lst:
    l.append(int(i))
'''
list_comp = '''
lst = range(10000000)
[int(i) for i in lst]
'''
_map = '''
lst = range(10000000)
list(map(int, lst))
'''

print(timeit.Timer(stmt=ordinary_loop).timeit(number=10))
print(timeit.Timer(stmt=list_comp).timeit(number=10))
print(timeit.Timer(stmt=_map).timeit(number=10))

Output

42.300742557436585
30.58364898989899
23.1211604744974