Anonymous user
User talk:CRGreathouse: Difference between revisions
→Knapsack problem/Unbounded answer in PARI/GP: Reply.
Line 9:
: If you want to keep it, feel free to "fix" it. I won't, because I think the fixed version is worse.
: [[User:CRGreathouse|CRGreathouse]] 05:29, 31 October 2010 (UTC)
::Hi again, I'll take your points and give replies:
::* I explained that no offence was meant. Sorry if it spoilt your RC experience.
::* My points were about getting the code to better fit the task description, and fit in better with the other examples. In this case scale is something that is good enough to do the task given. We do welcome talk of scalability and allow multiple solutions that address any other issues that contributors might want to bring up, but the program was on its own and so I thought it should accomplish the task as output from other examples does. When there are examples in other languages, with output, then it is good to either follow their examples or be aware of and probably explain answers that may be different.
::* The fix may well be obvious but in this case I thought that it should be given. You have shown that you know how to do it, but without the fix being in place I think that you cannot make a fair comparison with other language examples that use brute force but go that bit extra to only print the right answer, rather than a lot of wrong answers followed by the right answer. Other examples use different ''algorithms'' to add scalability.
::* I'm afraid I don't write PARI/GP so will not personally be applying a fix (I converted the code to Python and executed the Python to confirm my initial opinion).
::I guess we still disagree, but that's life. Thanks for your contributions to RC I do welcome them, as I do value the site and all who contribute. --[[User:Paddy3118|Paddy3118]] 06:08, 31 October 2010 (UTC)
| |||