[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Time/size complexity of APL algorithms or I have no clue
From: |
Bill Daly |
Subject: |
Time/size complexity of APL algorithms or I have no clue |
Date: |
Mon, 17 Feb 2020 10:29:00 -0500 |
User-agent: |
Mozilla/5.0 (X11; Linux x86_64; rv:68.0) Gecko/20100101 Thunderbird/68.5.0 |
I'm sending dom.apl from my apl-library (it needs work) together with
the libraries it copys. The function dom∆parse is slow and a memory
hog. You probably should say it should be rewritten in C and I would
agree. Each time I've thought about it, I laid down, put a hot compress
over my eyes until the thought went away.
w
dom.apl
Description: Text document
lex.apl
Description: Text document
utl.apl
Description: Text document
stack.apl
Description: Text document
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- Time/size complexity of APL algorithms or I have no clue,
Bill Daly <=