Programming puzzles: processing lists!

[pier4r]

(10-31-2017 12:40 PM)Gilles59 Wrote:  A string version is very very slow with big lists because of the STR-> command at the end.

Code:

Exact mode 
<< -> STR " " + SWAP " " +   SWAP ->STR SWAP " " SREPL DROP STR-> >>

I have no time with the David exemple : it was so slow that I cancelled the program after few minutes

I do

Code:


\<<
  \->STR
  "1." "" SREPL DROP
  OBJ\->
\>>

it is relatively slow, some 5+ seconds on 1000 terms, not minutes. (I did not test it yet on the 1..50 repeated list. I have another list that has many 1 )