On Fri, Mar 8, 2019 at 3:22 PM Michael Kay mike@xxxxxxxxxxxx <
xsl-list-service@xxxxxxxxxxxxxxxxxxxxxx> wrote:

> Yes, that's O(n^2), and if an O(n^2) solution is acceptable then you can
> do it more simply without a fold() using
>
> $inpValues ! sum(subsequence($inpValues, 1, position()))
>

Thanks, Mike for insights.

I've updated my online document, with the recent discussions.




-- 
Regards,
Mukul Gandhi