Open groutr opened 2 years ago
Convert these loops:
for item in seq: yield item
To the more modern and slightly more efficient
yield from seq
A quick benchmark (a is a list of 30 sorted lists of 60 random integers)
a
# old In [8]: %timeit list(merge_sorted(*a)) 815 µs ± 31.3 µs per loop (mean ± std. dev. of 7 runs, 1,000 loops each) # new In [7]: %timeit list(merge_sorted(*a)) 766 µs ± 26.2 µs per loop (mean ± std. dev. of 7 runs, 1,000 loops each)
Convert these loops:
To the more modern and slightly more efficient
A quick benchmark (
ais a list of 30 sorted lists of 60 random integers)