[fpc-pascal] Happy tickets benchmark

[Paulo Costa]

On 16-Feb-16 18:53, Mark Morgan Lloyd wrote:
> Serguei TARASSOV wrote:
...
>> Sounds like the real-life programs don't use inner loops or don't
>> solve NP-complete problems  :)
>> For info, my real-life examples are the application server and the DSL
>> script engine.
>> So any improvement of quality of FPC's generated code are welcome.
>
> Anybody using a high-level language for real work would be advised to
> understand the problem a bit better so that they didn't have to use your
> sort of brute-force approach. And at that point, having something that
> expresses higher-level algorithms and coding practices (threads, dynamic
> arrays) becomes at least as important as brute force efficiency.

I think that the original example should be treated as the code that is 
used to trigger a bug. It must be the simplest possible so the bug can 
be identified and corrected.

>... At which
> point, pointing out that FPC doesn't have a STEP or BY clause in the FOR
> statement would be far more useful criticism.

Depending on the problems that we want to solve, different language 
capabilities become more or less important...

Paulo Costa