HP 50g Programming Competition: How Many Partitions of an Integer in 4 Squares
|
04-13-2018, 01:12 PM
(This post was last modified: 04-13-2018 01:12 PM by pier4r.)
Post: #2
|
|||
|
|||
RE: HP 50g Programming Competition: How Many Partitions of an Integer in 4 Squares
Gerald thanks for the programming challenge.
What I find interesting is the metric. (04-13-2018 11:35 AM)Gerald H Wrote: Winner will be programme with lowest value of time*cuberoot(size). My perspective is that size is often paramount (likely due to the limited memory of older models). Weighting the speed with the size is also done, but with the size being as important as the speed well. Applying a sort of a filter to the size, the cube root, so to make two programs that have similar size not too different (well aside from the speed factor) is pretty neat. I'd like to add maintainability as well, but that is hard to define. One should set like a commitee for it. Wikis are great, Contribute :) |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)