Anonymous user
Talk:Stern-Brocot sequence: Difference between revisions
→deque over list?: remove unnecessary call to sum in deque example.
(→deque over list?: remove unnecessary call to sum in deque example.) |
|||
Line 37:
...: sb = deque([1, 1])
...: while True:
...: sb += [
...: yield sb.popleft()
...:
Line 56:
%time [1 + sum(1 for i in takewhile(lambda x: x != occur, stern_brocot2())) for occur in (list(range(1, 11)) + [2500])]
Wall time:
Out[
%time [1 + sum(1 for i in takewhile(lambda x: x != occur, stern_brocot2())) for occur in (list(range(1, 11)) + [2500])]
Wall time:
Out[
%time [1 + sum(1 for i in takewhile(lambda x: x != occur, stern_brocot2())) for occur in (list(range(1, 11)) + [2500])]
Wall time:
Out[
The deque is faster, (and the margin increases for later members of the series).
| |||