Little explorations with HP calculators (no Prime)
|
12-28-2018, 09:06 AM
(This post was last modified: 12-28-2018 09:10 AM by ijabbott.)
Post: #327
|
|||
|
|||
RE: Little explorations with HP calculators (no Prime)
I'm not that fluent in Python, but surely the O(n^2) versions of match_count above could be replaced with an O(n) version to speed it up a bit?
EDIT: Oh, I see Albert Chan has already done it in his version! — Ian Abbott |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 2 Guest(s)